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 29, 2026 14:02Victor MerckléVictor MerckléScore: 2,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:052,72330,665,03621,237,0001,096,0002,117,632stderr
2Aug 29, 2026 14:052,73030,600,24221,277,0001,114,0002,117,632stderr
3Aug 29, 2026 14:052,73430,794,53221,328,0001,094,0002,117,632stderr
4Aug 29, 2026 14:052,73630,799,31921,303,0001,135,0002,117,632stderr
5Aug 29, 2026 14:052,73730,757,18521,366,0001,081,0002,117,632stderr
6Aug 29, 2026 14:052,73930,845,67621,371,0001,090,0002,117,632stderr
7Aug 29, 2026 14:055,36152,055,95042,930,0001,032,0002,117,632stderr
8Aug 29, 2026 14:055,37752,261,38743,026,0001,069,0002,117,632stderr
9Aug 29, 2026 14:055,41052,493,16343,312,0001,052,0002,117,632stderr