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 listJan 18, 2026 06:22Josu San MartinJosu San MartinScore: 8,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 06:228,11697,005,55765,541,0001,008,0002,514,944
2Jan 18, 2026 06:228,11697,531,26765,545,0001,008,0002,514,944
3Jan 18, 2026 06:228,11893,819,63065,559,0001,008,0002,465,792
4Jan 18, 2026 06:228,11993,283,83866,572,00002,494,464
5Jan 18, 2026 06:228,12091,098,37065,572,0001,008,0002,510,848
6Jan 18, 2026 06:228,14293,852,39264,771,0001,992,0002,445,312
7Jan 18, 2026 06:228,14295,368,73064,774,0001,993,0002,457,600
8Jan 18, 2026 06:228,14593,520,66364,799,0001,993,0002,514,944
9Jan 18, 2026 06:228,14794,141,01264,808,0001,994,0002,445,312