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 31, 2026 14:40Victor MerckléVictor MerckléScore: 2,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 14:432,71430,759,94021,122,0001,138,0002,117,632stderr
2Aug 31, 2026 14:432,73930,852,04921,423,0001,044,0002,117,632stderr
3Aug 31, 2026 14:432,74231,546,60521,436,0001,055,0002,117,632stderr
4Aug 31, 2026 14:432,74531,650,55021,407,0001,106,0002,117,632stderr
5Aug 31, 2026 14:432,74830,872,40921,482,0001,057,0002,117,632stderr
6Aug 31, 2026 14:432,76330,783,62621,601,0001,056,0002,117,632stderr
7Aug 31, 2026 14:435,37352,139,01443,017,0001,047,0002,117,632stderr
8Aug 31, 2026 14:435,37452,265,85943,047,0001,026,0002,117,632stderr
9Aug 31, 2026 14:435,39153,304,65943,092,0001,120,0002,117,632stderr