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 listSep 8, 2026 07:14Victor MerckléVictor MerckléScore: 2,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 07:162,59729,671,13821,303,000024,576stderr
2Sep 8, 2026 07:162,60129,558,21221,331,000024,576stderr
3Sep 8, 2026 07:162,60329,509,86521,352,000024,576stderr
4Sep 8, 2026 07:162,60529,736,75521,368,000024,576stderr
5Sep 8, 2026 07:162,61029,635,17121,410,000024,576stderr
6Sep 8, 2026 07:162,61029,608,32221,409,000024,576stderr
7Sep 8, 2026 07:162,61129,803,27121,416,000024,576stderr
8Sep 8, 2026 07:162,61629,923,33021,456,000024,576stderr
9Sep 8, 2026 07:162,62229,763,56221,507,000024,576stderr