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 listJan 18, 2026 04:14Josu San MartinJosu San MartinScore: 12,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 04:1412,819129,804,895104,112,0001,001,0002,465,792
2Jan 18, 2026 04:1412,834125,822,829104,235,0001,002,0002,457,600
3Jan 18, 2026 04:1412,835129,900,227103,246,0002,004,0002,449,408