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 3, 2026 15:26TudyMTudyMScore: 12,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 15:3512,010115,313,51697,468,0001,014,0002,342,912
2May 3, 2026 15:3512,011114,894,67897,479,0001,019,0002,375,680
3May 3, 2026 15:3512,071116,194,81697,966,0001,024,0002,449,408
4May 3, 2026 15:3512,086114,708,31198,086,0001,022,0002,461,696
5May 3, 2026 15:3512,094117,023,70298,157,0001,018,0002,392,064
6May 3, 2026 15:3512,112117,063,32198,306,0001,018,0002,424,832
7May 3, 2026 15:3512,128115,537,07898,434,0001,021,0002,367,488
8May 3, 2026 15:3512,136115,308,21498,504,0001,015,0002,453,504
9May 3, 2026 15:3512,171116,920,48398,785,0001,023,0002,342,912