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 20, 2026 19:09M-RochatM-RochatScore: 9,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:109,58590,834,54374,512,0004,091,0002,113,536
2May 20, 2026 19:109,60190,208,09674,603,0004,130,0002,113,536
3May 20, 2026 19:109,71789,581,46475,635,0004,052,0002,113,536
4May 20, 2026 19:109,78289,692,88376,175,0004,039,0002,113,536
5May 20, 2026 19:109,94291,084,90577,486,0004,045,0002,113,536
6May 20, 2026 19:1021,712187,494,052174,016,0004,024,0002,117,632
7May 20, 2026 19:1021,830192,264,686174,987,0004,021,0002,117,632
8May 20, 2026 19:1021,833189,420,742175,009,0004,022,0002,117,632
9May 20, 2026 19:1021,989191,240,241175,134,0005,177,0002,117,632