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 5, 2026 17:43Hung T.NguyenHung T.NguyenScore: 29,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 17:4529,194257,039,601238,392,0001,005,0002,314,240
2May 5, 2026 17:4529,221254,725,224238,614,0001,005,0002,379,776
3May 5, 2026 17:4530,422263,637,787248,456,0001,005,0002,375,680