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 3, 2026 06:16Josu San MartinJosu San MartinScore: 3,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 06:173,23736,485,71725,365,0001,184,0002,117,632
2Sep 3, 2026 06:173,24636,661,75125,328,0001,290,0002,117,632
3Sep 3, 2026 06:173,25036,564,17225,463,0001,194,0002,117,632
4Sep 3, 2026 06:173,26636,692,41125,760,0001,023,0002,117,632
5Sep 3, 2026 06:173,27136,910,79225,796,0001,028,0002,117,632
6Sep 3, 2026 06:173,30537,065,26026,084,0001,025,0002,117,632
7Sep 3, 2026 06:1711,293102,559,58291,598,0001,009,0002,117,632
8Sep 3, 2026 06:1711,328102,813,30891,885,0001,008,0002,117,632
9Sep 3, 2026 06:1711,360103,050,29892,145,0001,009,0002,117,632