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 listJul 2, 2026 14:51A_ShamanA_ShamanScore: 13,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:5213,597120,823,575109,492,0002,006,0002,113,536
2Jul 2, 2026 14:5213,600120,796,299109,459,0002,064,0002,113,536
3Jul 2, 2026 14:5213,616120,940,695109,497,0002,155,0002,113,536
4Jul 2, 2026 14:5213,623122,616,126109,620,0002,095,0002,113,536
5Jul 2, 2026 14:5213,629121,102,579109,748,0002,011,0002,113,536
6Jul 2, 2026 14:5213,631121,094,907109,708,0002,067,0002,113,536
7Jul 2, 2026 14:5213,662121,455,258109,954,0002,075,0002,113,536
8Jul 2, 2026 14:5213,665121,491,354110,004,0002,053,0002,113,536
9Jul 2, 2026 14:5213,678121,398,358110,137,0002,027,0002,113,536