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 4, 2026 01:57Josu San MartinJosu San MartinScore: 13,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 01:5713,395141,473,880108,844,000998,0002,453,504
2Mar 4, 2026 01:5713,415136,526,816108,001,0002,000,0002,441,216
3Mar 4, 2026 01:5728,258261,648,593226,719,0004,993,0002,498,560