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 21, 2026 19:13A_ShamanA_ShamanScore: 50,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 19:1449,427414,700,440219,422,000185,886,0002,113,536
2Jun 21, 2026 19:1449,564415,548,096223,475,000182,952,0002,113,536
3Jun 21, 2026 19:1450,022419,714,323226,775,000183,409,0002,113,536
4Jun 21, 2026 19:1450,366422,189,839228,509,000184,498,0002,113,536
5Jun 21, 2026 19:1450,622424,337,186234,531,000180,574,0002,113,536
6Jun 21, 2026 19:1450,627424,411,824229,725,000185,424,0002,113,536
7Jun 21, 2026 19:1450,643424,923,361231,273,000184,005,0002,113,536
8Jun 21, 2026 19:1451,319430,006,582239,650,000181,166,0002,113,536
9Jun 21, 2026 19:1451,675432,950,181240,459,000183,280,0002,113,536