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 listMar 20, 2026 04:18olliecrowolliecrowScore: 3,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 04:053,41152,919,31325,971,0001,997,0002,428,928
2Mar 20, 2026 04:183,41656,264,76226,009,0002,000,0002,387,968
3Mar 20, 2026 04:073,42060,036,72426,045,0002,003,0002,392,064
4Mar 20, 2026 04:053,42652,945,85627,092,0001,003,0002,359,296
5Mar 20, 2026 04:053,43756,062,01226,174,0002,013,0002,510,848
6Mar 20, 2026 04:073,44751,732,88827,256,0001,009,0002,273,280
7Mar 20, 2026 04:183,51257,740,39826,811,0001,986,0002,461,696
8Mar 20, 2026 04:183,52159,534,00826,881,0001,991,0002,469,888
9Mar 20, 2026 04:0722,974213,481,983185,382,0003,006,0002,416,640