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 listSep 4, 2026 07:04Josu San MartinJosu San MartinScore: 3,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:063,03834,960,13623,868,0001,048,0002,121,728stderr
2Sep 4, 2026 07:063,04134,857,60723,885,0001,054,0002,121,728stderr
3Sep 4, 2026 07:063,05235,751,59324,005,0001,029,0002,121,728stderr
4Sep 4, 2026 07:063,06335,131,64324,090,0001,027,0002,121,728stderr
5Sep 4, 2026 07:063,06835,264,25424,134,0001,027,0002,121,728stderr
6Sep 4, 2026 07:0615,172134,986,351123,403,0001,010,0002,121,728stderr
7Sep 4, 2026 07:0615,179134,416,363123,466,0001,008,0002,121,728stderr
8Sep 4, 2026 07:0615,216135,472,341123,756,0001,016,0002,121,728stderr
9Sep 4, 2026 07:0615,236134,909,552123,923,0001,013,0002,121,728stderr