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 13:06Victor MerckléVictor MerckléScore: 2,762Success
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 13:092,74030,877,31021,382,0001,092,0002,117,632stderr
2Aug 29, 2026 13:092,75030,866,04621,455,0001,096,0002,117,632stderr
3Aug 29, 2026 13:092,75130,699,14321,535,0001,030,0002,117,632stderr
4Aug 29, 2026 13:092,75330,930,15321,405,0001,171,0002,117,632stderr
5Aug 29, 2026 13:092,76230,983,55521,634,0001,017,0002,117,632stderr
6Aug 29, 2026 13:092,76230,867,07621,634,0001,018,0002,117,632stderr
7Aug 29, 2026 13:092,76531,644,41021,651,0001,027,0002,117,632stderr
8Aug 29, 2026 13:095,42152,548,62243,330,0001,127,0002,117,632stderr
9Aug 29, 2026 13:095,42852,645,67343,450,0001,063,0002,117,632stderr