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 listJan 1, 2026 04:50KeefeKeefeScore: 10,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 04:5010,393106,626,90484,224,0001,002,0002,338,816
2Jan 1, 2026 04:5010,439113,955,28985,600,00002,359,296
3Jan 1, 2026 04:5010,452112,845,26584,713,000996,0002,416,640
4Jan 1, 2026 04:5010,456111,546,73782,749,0002,990,0002,301,952
5Jan 1, 2026 04:5010,468107,416,45680,850,0004,990,0002,359,296
6Jan 1, 2026 04:5010,469114,245,01283,846,0001,996,0002,297,856
7Jan 1, 2026 04:5010,504108,433,18685,129,0001,001,0002,330,624
8Jan 1, 2026 04:5010,522107,646,98686,283,00002,428,928
9Jan 1, 2026 04:5010,561117,742,22982,570,0004,027,0002,318,336