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 18, 2026 02:24Charles CabergsCharles CabergsScore: 17,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 02:2417,057164,468,264137,873,0001,998,0002,424,832
2Apr 18, 2026 02:2417,065168,468,487137,938,0001,999,0002,359,296
3Apr 18, 2026 02:2417,156166,221,591138,684,0001,995,0002,375,680