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 12:19Victor MerckléVictor MerckléScore: 5,340Success
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 12:202,74231,451,54421,467,0001,019,0002,117,632stderr
2Aug 29, 2026 12:202,75330,859,83921,564,0001,015,0002,117,632stderr
3Aug 29, 2026 12:202,75430,943,50221,564,0001,024,0002,117,632stderr
4Aug 29, 2026 12:202,76231,032,56521,634,0001,017,0002,117,632stderr
5Aug 29, 2026 12:205,34052,136,88942,748,0001,045,0002,117,632stderr
6Aug 29, 2026 12:205,39752,661,13843,220,0001,037,0002,117,632stderr
7Aug 29, 2026 12:205,40053,327,57943,165,0001,118,0002,117,632stderr
8Aug 29, 2026 12:205,41352,784,67743,272,0001,117,0002,117,632stderr
9Aug 29, 2026 12:205,48254,026,12043,673,0001,284,0002,117,632stderr