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 listApr 27, 2026 21:56TudyMTudyMScore: 17,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 21:5917,410162,994,255138,769,0003,993,0002,363,392
2Apr 27, 2026 21:5917,416158,141,423139,819,0002,996,0002,371,584
3Apr 27, 2026 21:5917,479159,859,810142,331,0001,002,0002,367,488
4Apr 27, 2026 21:5917,496160,631,903142,470,0001,003,0002,367,488
5Apr 27, 2026 21:5917,500161,780,983141,495,0002,007,0002,371,584
6Apr 27, 2026 21:5917,518157,440,181140,662,0002,992,0002,301,952
7Apr 27, 2026 21:5917,576165,825,131142,126,0002,001,0002,367,488
8Apr 27, 2026 21:5917,587163,495,734142,216,0002,003,0002,367,488
9Apr 27, 2026 21:5917,620166,228,601143,487,0001,003,0002,375,680