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 25, 2026 08:02olliecrowolliecrowScore: 23,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 08:033,30445,422,31726,091,0001,003,0002,334,720
2Apr 25, 2026 08:033,31939,869,28625,203,0002,016,0002,351,104
3Apr 25, 2026 08:0323,043206,734,305186,959,0001,999,0002,375,680
4Apr 25, 2026 08:0323,045209,842,058184,978,0003,999,0002,318,336
5Apr 25, 2026 08:0323,058206,969,434187,077,0002,000,0002,355,200
6Apr 25, 2026 08:0323,075207,920,842187,214,0002,002,0002,314,240
7Apr 25, 2026 08:0323,119207,320,375185,588,0003,991,0002,551,808
8Apr 25, 2026 08:0323,138202,210,468185,745,0003,994,0002,314,240
9Apr 25, 2026 08:0323,167205,341,078185,972,0003,999,0002,383,872