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 listSep 3, 2026 05:24Josu San MartinJosu San MartinScore: 18,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:253,55640,672,74128,100,0001,061,0002,113,536
2Sep 3, 2026 05:253,56939,240,71128,231,0001,037,0002,113,536
3Sep 3, 2026 05:253,59339,484,77428,432,0001,031,0002,113,536
4Sep 3, 2026 05:2511,189102,532,61385,303,0006,450,0002,113,536
5Sep 3, 2026 05:2518,675163,273,127146,955,0006,186,0002,117,632
6Sep 3, 2026 05:2519,078167,195,801150,012,0006,432,0002,117,632
7Sep 3, 2026 05:2519,524170,155,282153,620,0006,477,0002,117,632
8Sep 3, 2026 05:2520,401177,447,899160,769,0006,523,0002,117,632
9Sep 3, 2026 05:2521,738189,052,436171,533,0006,720,0002,117,632