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 16, 2026 15:47Maya RebholzMaya RebholzScore: 44,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 15:4842,016353,858,574287,122,00057,415,0002,449,408
2Jun 16, 2026 15:4842,679359,240,060293,942,00056,029,0002,449,408
3Jun 16, 2026 15:4843,206363,961,667301,890,00052,403,0002,449,408
4Jun 16, 2026 15:4843,415366,307,048299,564,00056,445,0002,449,408
5Jun 16, 2026 15:4844,325372,683,564309,770,00053,698,0002,449,408
6Jun 16, 2026 15:4845,411381,626,159316,672,00055,701,0002,449,408
7Jun 16, 2026 15:4846,069386,948,646321,006,00056,763,0002,449,408
8Jun 16, 2026 15:4846,080387,124,496321,893,00055,968,0002,449,408
9Jun 16, 2026 15:4847,392398,250,920332,413,00056,207,0002,449,408