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:17M-RochatM-RochatScore: 7,920Success
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:207,66772,204,72358,808,0004,065,0002,113,536
2May 20, 2026 19:207,67772,577,60558,925,0004,034,0002,113,536
3May 20, 2026 19:207,84274,320,91060,172,0004,136,0002,113,536
4May 20, 2026 19:207,84273,710,78060,288,0004,017,0002,113,536
5May 20, 2026 19:207,92074,290,38660,888,0004,058,0002,113,536
6May 20, 2026 19:2019,764173,233,073157,465,0004,604,0002,117,632
7May 20, 2026 19:2019,872174,065,604157,882,0005,075,0002,113,536
8May 20, 2026 19:2019,935172,840,310159,448,0004,024,0002,117,632
9May 20, 2026 19:2019,998173,430,437159,969,0004,022,0002,117,632