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 20:14Victor MerckléVictor MerckléScore: 2,669Success
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 20:152,58729,697,46121,217,000024,576stderr
2Sep 8, 2026 20:152,66030,238,19320,798,0001,015,00024,576stderr
3Sep 8, 2026 20:152,66531,084,02121,859,000024,576stderr
4Sep 8, 2026 20:152,66830,332,80820,808,0001,077,00024,576stderr
5Sep 8, 2026 20:152,66930,376,86220,793,0001,100,00024,576stderr
6Sep 8, 2026 20:152,69838,445,62621,109,0001,017,00024,576stderr
7Sep 8, 2026 20:152,72538,665,45921,337,0001,011,00024,576stderr
8Sep 8, 2026 20:155,46459,475,61543,793,0001,015,00024,576stderr
9Sep 8, 2026 20:155,56454,683,65644,617,0001,014,00024,576stderr