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 listNov 4, 2026 19:35e1011e1011Score: 130,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 19:3896,256800,765,491646,539,000142,761,0002,113,536
2Nov 4, 2026 19:38111,825928,369,117776,241,000140,730,0002,113,536
3Nov 4, 2026 19:38128,0481,061,052,106908,436,000141,563,0002,113,536
4Nov 4, 2026 19:38129,5691,073,964,088920,806,000141,662,0002,113,536
5Nov 4, 2026 19:38130,8521,084,677,472928,916,000144,075,0002,113,536
6Nov 4, 2026 19:38138,7001,148,731,612996,388,000140,958,0002,113,536
7Nov 4, 2026 19:38139,1051,151,595,724999,839,000140,827,0002,113,536
8Nov 4, 2026 19:38150,1051,242,318,7631,090,199,000140,663,0002,113,536
9Nov 4, 2026 19:38150,6231,246,567,5911,094,161,000140,952,0002,113,536