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 listMay 3, 2026 14:10TudyMTudyMScore: 17,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 14:1116,953154,913,209137,758,0001,261,0002,379,776
2May 3, 2026 14:1116,974155,834,259138,183,0001,011,0002,363,392
3May 3, 2026 14:1116,992155,417,863138,097,0001,245,0002,347,008
4May 3, 2026 14:1117,026155,885,621138,336,0001,278,0002,367,488
5May 3, 2026 14:1117,028155,074,903138,536,0001,094,0002,355,200
6May 3, 2026 14:1117,034157,943,763138,678,0001,008,0002,359,296
7May 3, 2026 14:1117,121155,667,885139,149,0001,248,0002,367,488
8May 3, 2026 14:1117,145154,022,015139,590,0001,007,0002,363,392
9May 3, 2026 14:1117,414160,005,553141,608,0001,188,0002,371,584