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 17:37Victor MerckléVictor MerckléScore: 5,385Success
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 17:382,75430,905,82021,560,0001,024,0002,117,632stderr
2Aug 23, 2026 17:382,77231,786,61721,716,0001,016,0002,117,632stderr
3Aug 23, 2026 17:382,77831,114,01221,761,0001,020,0002,117,632stderr
4Aug 23, 2026 17:382,89740,786,00622,656,0001,104,0002,117,632stderr
5Aug 23, 2026 17:385,38552,501,37243,056,0001,103,0002,117,632stderr
6Aug 23, 2026 17:385,39452,625,70743,078,0001,157,0002,117,632stderr
7Aug 23, 2026 17:385,40552,681,37843,248,0001,076,0002,117,632stderr
8Aug 23, 2026 17:385,65062,667,57345,062,0001,274,0002,117,632stderr
9Aug 23, 2026 17:385,72255,350,93045,899,0001,022,0002,117,632stderr