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 19, 2026 15:54Victor MerckléVictor MerckléScore: 5,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 16:012,75130,863,75621,490,0001,072,0002,117,632stderr
2Aug 19, 2026 16:012,75930,945,93321,529,0001,096,0002,117,632stderr
3Aug 19, 2026 16:012,79031,908,06921,864,0001,021,0002,117,632stderr
4Aug 19, 2026 16:012,81232,005,03622,038,0001,024,0002,117,632stderr
5Aug 19, 2026 16:015,42652,747,91643,463,0001,037,0002,117,632stderr
6Aug 19, 2026 16:015,44152,893,23843,494,0001,128,0002,117,632stderr
7Aug 19, 2026 16:015,45153,017,77643,563,0001,137,0002,117,632stderr
8Aug 19, 2026 16:015,53353,653,69644,214,0001,164,0002,117,632stderr
9Aug 19, 2026 16:0114,747129,241,544119,921,0001,008,0002,117,632stderr