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 21, 2026 22:17BenBenScore: 12,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 22:1912,513119,028,528100,597,0002,011,0002,396,160
2Apr 21, 2026 22:1912,515120,906,918100,614,0002,012,0002,330,624
3Apr 21, 2026 22:1912,526124,888,98999,699,0003,021,0002,314,240
4Apr 21, 2026 22:1912,526116,442,50599,699,0003,021,0002,318,336
5Apr 21, 2026 22:1912,534119,348,77199,792,0002,993,0002,301,952
6Apr 21, 2026 22:1912,546117,197,055100,887,0001,997,0002,420,736
7Apr 21, 2026 22:1912,560120,315,72999,998,0002,999,0002,297,856
8Apr 21, 2026 22:1912,562123,103,558101,012,0002,000,0002,297,856
9Apr 21, 2026 22:1912,612124,448,100101,411,0002,008,0002,404,352