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 1, 2026 13:28Victor MerckléVictor MerckléScore: 5,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 13:292,64930,064,29420,654,0001,069,0002,117,632stderr
2Sep 1, 2026 13:292,65130,129,96120,718,0001,024,0002,117,632stderr
3Sep 1, 2026 13:292,65230,112,51320,722,0001,030,0002,117,632stderr
4Sep 1, 2026 13:292,65230,097,43720,722,0001,031,0002,117,632stderr
5Sep 1, 2026 13:295,30451,881,87742,244,0001,256,0002,117,632stderr
6Sep 1, 2026 13:295,30651,860,06442,334,0001,183,0002,117,632stderr
7Sep 1, 2026 13:295,31351,970,65042,303,0001,266,0002,117,632stderr
8Sep 1, 2026 13:295,32552,959,23642,653,0001,018,0002,117,632stderr
9Sep 1, 2026 13:295,35052,302,80642,861,0001,016,0002,117,632stderr