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 8, 2026 05:45Victor MerckléVictor MerckléScore: 9,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 05:473,98642,610,79331,631,0001,057,0002,117,632stderr
2Sep 8, 2026 05:474,00342,825,51731,794,0001,031,0002,117,632stderr
3Sep 8, 2026 05:474,01042,841,59131,852,0001,031,0002,117,632stderr
4Sep 8, 2026 05:474,06143,256,19031,238,0002,069,0002,117,632stderr
5Sep 8, 2026 05:479,15185,055,53871,936,0003,103,0002,117,632stderr
6Sep 8, 2026 05:479,26186,115,77072,863,0003,078,0002,117,632stderr
7Sep 8, 2026 05:479,36386,836,83573,611,0003,171,0002,117,632stderr
8Sep 8, 2026 05:479,46087,601,84174,537,0003,035,0002,117,632stderr
9Sep 8, 2026 05:4739,014329,974,777316,768,0003,148,0002,117,632stderr