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 27, 2026 13:15Dominique GarmierDominique GarmierScore: 123,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 13:15121,5771,020,240,322995,929,000999,0002,437,120
2Mar 27, 2026 13:15123,0901,033,809,6241,005,343,0003,997,0002,523,136
3Mar 27, 2026 13:15123,3581,033,831,1291,010,535,000999,0002,371,584