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:43Victor MerckléVictor MerckléScore: 2,887Success
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:452,82531,516,00422,069,0001,098,0002,117,632stderr
2Aug 23, 2026 17:452,84631,776,73622,151,0001,188,0002,117,632stderr
3Aug 23, 2026 17:452,85231,744,51922,206,0001,184,0002,117,632stderr
4Aug 23, 2026 17:452,86732,518,10022,313,0001,203,0002,117,632stderr
5Aug 23, 2026 17:452,88731,997,37022,574,0001,104,0002,117,632stderr
6Aug 23, 2026 17:455,51853,599,70044,234,0001,017,0002,117,632stderr
7Aug 23, 2026 17:455,53753,725,98344,382,0001,022,0002,117,632stderr
8Aug 23, 2026 17:455,56754,669,31744,626,0001,026,0002,117,632stderr
9Aug 23, 2026 17:4512,897115,039,741103,632,0002,127,0002,117,632stderr