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 listMar 20, 2026 04:15olliecrowolliecrowScore: 3,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 04:153,48754,346,44627,574,0001,021,0002,273,280
2Mar 20, 2026 04:153,66658,311,59728,058,0002,004,0002,428,928
3Mar 20, 2026 04:1523,196211,776,190185,200,0005,005,0002,461,696