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 listMay 21, 2026 23:28M-RochatM-RochatScore: 9,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 23:299,53087,394,79174,484,0003,666,0002,113,536
2May 21, 2026 23:299,66988,539,98275,643,0003,648,0002,113,536
3May 21, 2026 23:299,68391,731,01275,880,0003,527,0002,113,536
4May 21, 2026 23:299,69988,911,09275,992,0003,543,0002,113,536
5May 21, 2026 23:299,70289,069,05276,031,0003,528,0002,113,536
6May 21, 2026 23:299,73890,950,88376,189,0003,664,0002,113,536
7May 21, 2026 23:2926,487226,510,549212,489,0004,710,0002,117,632
8May 21, 2026 23:2926,557226,985,275213,754,0004,017,0002,113,536
9May 21, 2026 23:2926,716230,432,472214,310,0004,764,0002,117,632