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 22:12TudyMTudyMScore: 21,122Success
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 22:1921,061190,265,371169,709,0002,994,0002,355,200
2Apr 27, 2026 22:1921,071192,420,359170,793,0001,997,0002,367,488
3Apr 27, 2026 22:1921,111187,804,967171,114,0002,001,0002,375,680
4Apr 27, 2026 22:1921,119189,146,665172,179,0001,001,0002,506,752
5Apr 27, 2026 22:1921,122191,516,510171,199,0002,002,0002,371,584
6Apr 27, 2026 22:1921,165190,330,378171,562,0001,994,0002,359,296
7Apr 27, 2026 22:1921,250196,776,685170,252,0004,005,0002,363,392
8Apr 27, 2026 22:1921,299196,171,208172,658,0001,996,0002,371,584
9Apr 27, 2026 22:1921,383192,909,492173,343,0002,003,0002,359,296