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 listJun 7, 2026 16:12Victor MerckléVictor MerckléScore: 3,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:133,36336,766,82326,533,0001,048,0002,113,536
2Jun 7, 2026 16:133,37336,771,48926,631,0001,034,0002,113,536
3Jun 7, 2026 16:133,40237,464,50226,850,0001,048,0002,113,536
4Jun 7, 2026 16:133,41337,070,45426,953,0001,038,0002,113,536
5Jun 7, 2026 16:133,41437,106,20826,960,0001,037,0002,113,536
6Jun 7, 2026 16:133,42537,200,99527,048,0001,038,0002,113,536
7Jun 7, 2026 16:133,42937,266,22526,093,0002,031,0002,113,536
8Jun 7, 2026 16:133,43537,323,97426,167,0002,008,0002,113,536
9Jun 7, 2026 16:1312,829114,313,934102,927,0002,277,0002,113,536