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 29, 2026 13:53TudyMTudyMScore: 20,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:0220,312186,402,619163,569,0002,992,0002,379,776
2Apr 29, 2026 14:0220,319183,082,269165,617,0001,003,0002,367,488
3Apr 29, 2026 14:0220,331184,311,475165,721,000998,0002,367,488
4Apr 29, 2026 14:0220,375186,878,228165,082,0002,000,0002,371,584
5Apr 29, 2026 14:0220,381182,225,703166,130,0001,000,0002,367,488
6Apr 29, 2026 14:0220,387185,278,774166,173,0001,001,0002,363,392
7Apr 29, 2026 14:0220,391181,157,397165,205,0002,002,0002,371,584
8Apr 29, 2026 14:0220,416189,110,065165,420,0001,993,0002,371,584
9Apr 29, 2026 14:0220,451187,785,036165,708,0001,996,0002,367,488