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 listOct 9, 2026 03:44highload-churnerhighload-churnerScore: 27,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 03:465,18453,740,19140,473,0002,041,0002,113,536
2Oct 9, 2026 03:4627,207233,641,077222,097,0001,005,0002,117,632
3Oct 9, 2026 03:4627,558236,533,689223,965,0002,014,0002,117,632
4Oct 9, 2026 03:4627,853239,046,267226,324,0002,071,0002,117,632
5Oct 9, 2026 03:4627,862238,989,451226,461,0002,009,0002,117,632
6Oct 9, 2026 03:4628,196241,798,627228,102,0003,113,0002,117,632
7Oct 9, 2026 03:4628,884247,387,045234,845,0002,009,0002,117,632
8Oct 9, 2026 03:4628,884247,378,615234,849,0002,007,0002,117,632
9Oct 9, 2026 03:4629,366251,378,576238,771,0002,038,0002,117,632