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:08Victor MerckléVictor MerckléScore: 2,800Success
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:092,75230,990,66421,438,0001,132,0002,117,632stderr
2Aug 23, 2026 17:092,77031,075,37621,529,0001,188,0002,117,632stderr
3Aug 23, 2026 17:092,77731,126,50421,736,0001,041,0002,117,632stderr
4Aug 23, 2026 17:092,78231,163,10721,700,0001,115,0002,117,632stderr
5Aug 23, 2026 17:092,80031,908,33021,940,0001,028,0002,117,632stderr
6Aug 23, 2026 17:095,39352,570,68543,191,0001,033,0002,117,632stderr
7Aug 23, 2026 17:095,41452,737,72243,347,0001,048,0002,117,632stderr
8Aug 23, 2026 17:095,44753,673,53343,526,0001,142,0002,117,632stderr
9Aug 23, 2026 17:095,51054,193,54543,984,0001,204,0002,117,632stderr