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 21, 2026 23:33M-RochatM-RochatScore: 7,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 23:367,64272,151,24058,598,0004,073,0002,113,536
2May 21, 2026 23:367,71374,989,58459,154,0004,094,0002,113,536
3May 21, 2026 23:367,77976,257,05259,685,0004,106,0002,113,536
4May 21, 2026 23:367,81973,560,15560,091,0004,032,0002,113,536
5May 21, 2026 23:367,82573,753,55160,093,0004,072,0002,113,536
6May 21, 2026 23:367,90476,856,30660,802,0004,017,0002,113,536
7May 21, 2026 23:3619,740171,425,170157,843,0004,025,0002,117,632
8May 21, 2026 23:3619,779171,524,223157,676,0004,514,0002,117,632
9May 21, 2026 23:3619,837172,770,619157,631,0005,035,0002,117,632