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 listJul 8, 2026 03:38Victor MerckléVictor MerckléScore: 11,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 03:392,95632,128,03123,117,0001,129,0002,117,632stderr
2Jul 8, 2026 03:393,09733,465,08424,287,0001,115,0002,117,632stderr
3Jul 8, 2026 03:3911,749104,353,22095,338,0001,008,0002,117,632stderr
4Jul 8, 2026 03:3911,765104,377,13595,467,0001,010,0002,117,632stderr
5Jul 8, 2026 03:3911,770104,539,89095,512,0001,008,0002,117,632stderr
6Jul 8, 2026 03:3911,826104,939,67695,968,0001,011,0002,117,632stderr
7Jul 8, 2026 03:3911,885105,565,93096,448,0001,010,0002,117,632stderr
8Jul 8, 2026 03:3911,915105,695,53496,699,0001,011,0002,117,632stderr
9Jul 8, 2026 03:3912,270108,714,38499,608,0001,010,0002,117,632stderr