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:48Victor MerckléVictor MerckléScore: 3,750Success
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:513,44736,420,44821,083,0007,184,00024,576stderr
2Sep 8, 2026 07:513,59937,795,13521,149,0008,364,00024,576stderr
3Sep 8, 2026 07:513,60938,590,14821,501,0008,095,00024,576stderr
4Sep 8, 2026 07:513,74638,959,03121,413,0009,309,00024,576stderr
5Sep 8, 2026 07:513,75038,984,58221,509,0009,245,00024,576stderr
6Sep 8, 2026 07:513,93740,661,85621,434,00010,856,00024,576stderr
7Sep 8, 2026 07:513,94840,763,04621,269,00011,107,00024,576stderr
8Sep 8, 2026 07:514,00241,013,81321,543,00011,275,00024,576stderr
9Sep 8, 2026 07:516,27159,772,32943,194,0008,235,00024,576stderr