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:56TudyMTudyMScore: 17,487Success
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 14:0917,415159,675,639140,814,0001,997,0002,371,584
2Apr 29, 2026 14:0917,418159,435,066139,839,0002,996,0002,555,904
3Apr 29, 2026 14:0917,425163,291,455141,893,000999,0002,359,296
4Apr 29, 2026 14:0917,458159,623,042141,157,0002,002,0002,367,488
5Apr 29, 2026 14:0917,487162,700,261142,395,0001,002,0002,301,952
6Apr 29, 2026 14:0917,508161,435,353141,563,0002,007,0002,359,296
7Apr 29, 2026 14:0917,533161,417,648140,776,0002,995,0002,375,680
8Apr 29, 2026 14:0917,567160,853,016141,052,0003,001,0002,301,952
9Apr 29, 2026 14:0917,598162,842,528143,302,0001,002,0002,301,952