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 16:53Victor MerckléVictor MerckléScore: 2,627Success
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 16:562,55029,351,04820,915,000024,576stderr
2Sep 8, 2026 16:562,55729,333,48920,970,000024,576stderr
3Sep 8, 2026 16:562,56129,221,43021,002,000024,576stderr
4Sep 8, 2026 16:562,58429,420,68321,191,000024,576stderr
5Sep 8, 2026 16:562,62729,774,66421,547,000024,576stderr
6Sep 8, 2026 16:565,37852,482,36943,091,0001,012,00024,576stderr
7Sep 8, 2026 16:565,39552,719,83443,224,0001,015,00024,576stderr
8Sep 8, 2026 16:565,41552,861,38243,393,0001,014,00024,576stderr
9Sep 8, 2026 16:565,43252,776,53543,529,0001,015,00024,576stderr