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 04:23e1011e1011Score: 141,261Success
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 04:24117,785977,217,714824,198,000141,642,0002,113,536
2Nov 4, 2026 04:24119,811993,585,174842,571,000139,880,0002,113,536
3Nov 4, 2026 04:24128,1231,062,049,407909,619,000140,996,0002,113,536
4Nov 4, 2026 04:24130,7931,083,524,610931,580,000140,928,0002,113,536
5Nov 4, 2026 04:24141,2611,169,765,4841,017,102,000141,246,0002,113,536
6Nov 4, 2026 04:24145,2821,202,861,3761,051,014,000140,301,0002,113,536
7Nov 4, 2026 04:24163,4601,351,339,2251,200,542,000139,833,0002,113,536
8Nov 4, 2026 04:24177,3181,464,962,2561,313,100,000140,911,0002,113,536
9Nov 4, 2026 04:24197,0201,627,060,5721,475,656,000139,912,0002,113,536