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 18:33Maya RebholzMaya RebholzScore: 11,608Success
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 18:3410,59796,057,26484,814,0002,087,0002,113,536
2Jun 17, 2026 18:3410,67197,130,55585,349,0002,156,0002,113,536
3Jun 17, 2026 18:3411,158101,293,97989,321,0002,182,0002,113,536
4Jun 17, 2026 18:3411,465103,269,13191,726,0002,289,0002,113,536
5Jun 17, 2026 18:3411,608104,390,03893,096,0002,096,0002,113,536
6Jun 17, 2026 18:3411,692105,467,46393,696,0002,183,0002,113,536
7Jun 17, 2026 18:3411,736105,452,42894,058,0002,184,0002,113,536
8Jun 17, 2026 18:3411,870106,889,17694,997,0002,341,0002,113,536
9Jun 17, 2026 18:3412,028108,340,96996,478,0002,155,0002,113,536