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 18, 2026 03:55M-RochatM-RochatScore: 22,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 03:579,95790,938,19676,907,0004,746,0002,113,536
2May 18, 2026 03:579,96093,746,20076,863,0004,815,0002,113,536
3May 18, 2026 03:5710,14892,557,33078,017,0005,198,0002,113,536
4May 18, 2026 03:5722,029190,811,569175,611,0005,030,0002,113,536
5May 18, 2026 03:5722,050190,683,338175,034,0005,776,0002,117,632
6May 18, 2026 03:5722,059191,726,597175,111,0005,779,0002,117,632
7May 18, 2026 03:5722,075193,473,906174,997,0006,019,0002,117,632
8May 18, 2026 03:5722,089193,881,391175,111,0006,022,0002,117,632
9May 18, 2026 03:5722,099193,132,685175,415,0005,800,0002,117,632