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 17:45Andrew EpsteinAndrew EpsteinScore: 31,079Success
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 17:4620,854181,457,208169,997,0001,006,0002,117,632stderr
2Sep 19, 2026 17:4620,946182,117,313170,758,0001,005,0002,117,632stderr
3Sep 19, 2026 17:4621,026182,855,237171,416,0001,005,0002,117,632stderr
4Sep 19, 2026 17:4625,144216,761,637205,181,0001,004,0002,117,632stderr
5Sep 19, 2026 17:4631,079265,229,137253,844,0001,004,0002,117,632stderr
6Sep 19, 2026 17:4636,019305,922,741293,324,0002,034,0002,117,632stderr
7Sep 19, 2026 17:4636,062306,199,744294,707,0001,003,0002,117,632stderr
8Sep 19, 2026 17:4636,495309,709,798298,257,0001,004,0002,117,632stderr
9Sep 19, 2026 17:4636,787312,203,312300,658,0001,003,0002,117,632stderr