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:57A_ShamanA_ShamanScore: 13,667Success
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:5713,610122,210,311109,583,0002,021,0002,113,536
2Jul 2, 2026 14:5713,646121,285,058109,802,0002,103,0002,113,536
3Jul 2, 2026 14:5713,650121,224,179109,835,0002,095,0002,113,536
4Jul 2, 2026 14:5713,657121,302,941109,930,0002,064,0002,113,536
5Jul 2, 2026 14:5713,667121,426,064110,039,0002,036,0002,113,536
6Jul 2, 2026 14:5713,685121,552,465110,128,0002,097,0002,113,536
7Jul 2, 2026 14:5713,725121,871,193110,454,0002,098,0002,113,536
8Jul 2, 2026 14:5713,752122,082,213110,644,0002,130,0002,113,536
9Jul 2, 2026 14:5713,775122,350,078110,783,0002,172,0002,113,536