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 listAug 23, 2026 14:47Victor MerckléVictor MerckléScore: 3,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 14:483,04233,158,21123,929,0001,016,0002,117,632stderr
2Aug 23, 2026 14:483,07734,210,01324,130,0001,106,0002,117,632stderr
3Aug 23, 2026 14:483,07833,433,30624,232,0001,013,0002,117,632stderr
4Aug 23, 2026 14:483,08233,537,66624,252,0001,022,0002,117,632stderr
5Aug 23, 2026 14:483,19134,376,59125,030,0001,144,0002,117,632stderr
6Aug 23, 2026 14:485,68254,895,24445,456,0001,137,0002,117,632stderr
7Aug 23, 2026 14:485,73755,160,21345,936,0001,112,0002,117,632stderr
8Aug 23, 2026 14:485,76655,545,95746,154,0001,131,0002,117,632stderr
9Aug 23, 2026 14:486,24959,400,90750,227,0001,016,0002,117,632stderr