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 13:48TudyMTudyMScore: 17,292Success
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 13:4917,266157,755,869140,319,0001,265,0002,347,008
2May 3, 2026 13:4917,286157,790,205140,495,0001,253,0002,359,296
3May 3, 2026 13:4917,288157,502,326140,515,0001,249,0002,355,200
4May 3, 2026 13:4917,289155,495,636140,541,0001,231,0002,359,296
5May 3, 2026 13:4917,292160,989,435140,519,0001,279,0002,363,392
6May 3, 2026 13:4917,297157,509,596140,582,0001,260,0002,359,296
7May 3, 2026 13:4917,299160,165,231140,627,0001,228,0002,363,392
8May 3, 2026 13:4917,308156,506,110140,679,0001,247,0002,363,392
9May 3, 2026 13:4917,314157,328,118140,736,0001,246,0002,359,296