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 listApr 26, 2026 18:29TudyMTudyMScore: 41,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:3040,761355,429,360333,246,0001,000,0002,301,952
2Apr 26, 2026 18:3041,150358,687,374335,433,0002,002,0002,367,488
3Apr 26, 2026 18:3041,188355,428,982335,748,0001,998,0002,363,392
4Apr 26, 2026 18:3041,636358,143,527339,419,0002,002,0002,457,600
5Apr 26, 2026 18:3041,954367,174,680341,030,0003,000,0002,367,488
6Apr 26, 2026 18:3041,965367,813,354342,115,0002,000,0002,371,584
7Apr 26, 2026 18:3041,999363,869,998343,395,0001,001,0002,363,392
8Apr 26, 2026 18:3042,329362,517,068345,104,0002,000,0002,310,144
9Apr 26, 2026 18:3042,620364,985,763348,491,0001,001,0002,371,584