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 19, 2026 19:45Andrew EpsteinAndrew EpsteinScore: 32,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:4631,434268,906,010256,762,0001,004,0002,117,632stderr
2Sep 19, 2026 19:4631,684270,164,886258,807,0001,002,0002,117,632stderr
3Sep 19, 2026 19:4631,855271,724,648260,214,0001,004,0002,117,632stderr
4Sep 19, 2026 19:4631,929272,970,818260,819,0001,003,0002,117,632stderr
5Sep 19, 2026 19:4632,021273,114,933261,574,0001,006,0002,117,632stderr
6Sep 19, 2026 19:4632,065274,193,571261,934,0001,007,0002,117,632stderr
7Sep 19, 2026 19:4632,618277,883,703266,463,0001,005,0002,117,632stderr
8Sep 19, 2026 19:4632,715278,919,284267,261,0001,003,0002,117,632stderr
9Sep 19, 2026 19:4632,866280,063,911268,495,0001,007,0002,117,632stderr