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 15:01Victor MerckléVictor MerckléScore: 5,925Success
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 15:023,25034,905,60625,644,0001,014,0002,117,632stderr
2Aug 23, 2026 15:023,28335,132,91025,897,0001,024,0002,117,632stderr
3Aug 23, 2026 15:025,87456,340,29547,120,0001,053,0002,117,632stderr
4Aug 23, 2026 15:025,92456,884,56747,445,0001,133,0002,117,632stderr
5Aug 23, 2026 15:025,92557,521,08147,462,0001,130,0002,117,632stderr
6Aug 23, 2026 15:025,93256,783,99447,525,0001,122,0002,117,632stderr
7Aug 23, 2026 15:025,93356,763,53747,536,0001,119,0002,117,632stderr
8Aug 23, 2026 15:025,93956,872,16547,569,0001,134,0002,117,632stderr
9Aug 23, 2026 15:025,95757,037,84147,826,0001,026,0002,117,632stderr