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 15:07Andrew EpsteinAndrew EpsteinScore: 44,868Success
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 15:0844,191372,800,825359,312,0003,057,0002,117,632stderr
2Sep 19, 2026 15:0844,241373,160,956359,735,0003,044,0002,117,632stderr
3Sep 19, 2026 15:0844,650377,230,003362,815,0003,323,0002,117,632stderr
4Sep 19, 2026 15:0844,828379,345,757364,513,0003,084,0002,117,632stderr
5Sep 19, 2026 15:0844,868378,327,167364,687,0003,231,0002,117,632stderr
6Sep 19, 2026 15:0845,114381,026,634366,770,0003,167,0002,117,632stderr
7Sep 19, 2026 15:0845,257382,668,451367,959,0003,155,0002,117,632stderr
8Sep 19, 2026 15:0845,328382,779,180368,615,0003,078,0002,117,632stderr
9Sep 19, 2026 15:0845,696385,751,005371,552,0003,157,0002,117,632stderr