Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listNov 4, 2025 22:12AntonAntonScore: 31,502Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 22:1230,704279,882,381248,773,0002,997,0002,535,424
2Nov 4, 2025 22:1230,932278,226,462250,649,0002,995,0002,539,520
3Nov 4, 2025 22:1231,116285,397,856253,152,0002,001,0002,301,952
4Nov 4, 2025 22:1231,187281,216,655252,734,0002,996,0002,527,232
5Nov 4, 2025 22:1231,502286,115,763256,314,0002,002,0002,547,712
6Nov 4, 2025 22:1231,680284,359,053257,778,0001,998,0002,535,424
7Nov 4, 2025 22:1231,723285,347,885258,131,0002,001,0002,297,856
8Nov 4, 2025 22:1232,112290,407,598261,314,0002,002,0002,543,616
9Nov 4, 2025 22:1233,259298,513,525270,725,0001,997,0002,547,712