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 3, 2026 05:20Josu San MartinJosu San MartinScore: 157,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 05:20144,1884,143,647,930175,656,0001,006,685,000339,968
2Mar 3, 2026 05:20157,9434,430,288,211262,751,0001,032,384,000282,624
3Mar 3, 2026 05:20159,8324,335,185,296297,223,0001,013,401,000315,392