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 17, 2026 16:40Maya RebholzMaya RebholzScore: 9,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 16:419,77189,550,23879,103,0001,020,0002,113,536
2Jun 17, 2026 16:419,77289,420,09879,123,0001,014,0002,113,536
3Jun 17, 2026 16:419,77689,422,99979,144,0001,020,0002,113,536
4Jun 17, 2026 16:419,77789,408,91479,161,0001,017,0002,113,536
5Jun 17, 2026 16:419,77989,360,80579,168,0001,020,0002,113,536
6Jun 17, 2026 16:419,78589,904,65579,216,0001,023,0002,113,536
7Jun 17, 2026 16:419,79090,292,34379,241,0001,040,0002,113,536
8Jun 17, 2026 16:419,79689,604,97979,313,0001,022,0002,113,536
9Jun 17, 2026 16:419,79789,949,03479,314,0001,025,0002,113,536