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 listDec 26, 2025 04:11Josu San MartinJosu San MartinScore: 13,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 04:1012,956137,572,311104,233,0002,004,0002,506,752
2Dec 26, 2025 04:1012,956134,110,464103,235,0003,006,0002,420,736
3Dec 26, 2025 04:1112,987135,330,745104,481,0002,009,0002,351,104
4Dec 26, 2025 04:1013,039130,666,882105,921,000999,0002,273,280
5Dec 26, 2025 04:1113,041131,403,553104,941,0001,998,0002,355,200
6Dec 26, 2025 04:1113,047132,052,439104,985,0001,999,0002,510,848