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:02TudyMTudyMScore: 18,958Success
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:0318,861171,812,022153,657,0001,008,0002,371,584
2May 3, 2026 14:0318,910170,798,734154,052,0001,013,0002,351,104
3May 3, 2026 14:0318,911169,312,329154,070,0001,006,0002,359,296
4May 3, 2026 14:0318,954170,857,489154,168,0001,261,0002,359,296
5May 3, 2026 14:0318,958171,889,183154,448,0001,009,0002,351,104
6May 3, 2026 14:0318,972171,791,169154,305,0001,271,0002,375,680
7May 3, 2026 14:0318,979170,548,225154,625,0001,006,0002,371,584
8May 3, 2026 14:0319,127171,086,098155,838,0001,007,0002,367,488
9May 3, 2026 14:0319,194173,367,338156,121,0001,276,0002,347,008