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 29, 2026 13:50TudyMTudyMScore: 17,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:5917,406161,761,053140,734,0001,996,0002,363,392
2Apr 29, 2026 13:5917,420162,734,155140,855,0001,997,0002,371,584
3Apr 29, 2026 13:5917,512164,104,004139,614,0003,988,0002,371,584
4Apr 29, 2026 13:5917,526162,864,232141,722,0001,996,0002,371,584
5Apr 29, 2026 13:5917,532163,537,215141,774,0001,996,0002,367,488
6Apr 29, 2026 13:5917,545163,890,665140,873,0002,997,0002,367,488
7Apr 29, 2026 13:5917,562159,908,329141,010,0003,000,0002,371,584
8Apr 29, 2026 13:5917,642163,199,650142,672,0001,995,0002,371,584
9Apr 29, 2026 13:5917,777162,185,272143,782,0001,996,0002,367,488