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 listMay 22, 2026 22:34M-RochatM-RochatScore: 5,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 22:355,31154,442,60840,489,0003,066,0002,113,536
2May 22, 2026 22:355,40453,775,11941,033,0003,287,0002,113,536
3May 22, 2026 22:355,46755,280,74141,787,0003,049,0002,113,536
4May 22, 2026 22:355,48254,601,63541,891,0003,062,0002,113,536
5May 22, 2026 22:355,52154,551,17742,101,0003,177,0002,113,536
6May 22, 2026 22:355,58756,139,93842,644,0003,172,0002,113,536
7May 22, 2026 22:3522,181191,076,274177,842,0004,046,0002,117,632
8May 22, 2026 22:3522,346194,925,255179,062,0004,177,0002,113,536
9May 22, 2026 22:3522,415193,000,866179,528,0004,280,0002,113,536