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 12, 2026 11:13Victor MerckléVictor MerckléScore: 3,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 11:143,38836,768,70826,725,0001,064,0002,113,536
2Jun 12, 2026 11:143,39436,885,37625,770,0002,066,0002,113,536
3Jun 12, 2026 11:143,40837,049,03126,878,0001,074,0002,113,536
4Jun 12, 2026 11:143,41337,153,27725,925,0002,067,0002,113,536
5Jun 12, 2026 11:143,42837,278,95426,109,0002,005,0002,113,536
6Jun 12, 2026 11:143,95841,512,51530,304,0002,153,0002,113,536
7Jun 12, 2026 11:143,96841,625,96930,426,0002,117,0002,113,536
8Jun 12, 2026 11:144,02742,068,46430,735,0002,290,0002,113,536
9Jun 12, 2026 11:1412,859114,569,635103,413,0002,032,0002,113,536