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 listMar 4, 2026 00:25olliecrowolliecrowScore: 12,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:2512,458128,057,419100,153,0002,003,0002,461,696
2Mar 4, 2026 00:2512,463126,069,360100,190,0002,003,0002,449,408
3Mar 4, 2026 00:2512,464131,619,954100,198,0002,003,0002,445,312
4Mar 4, 2026 00:2512,464126,364,112100,203,0002,004,0002,457,600
5Mar 4, 2026 00:2512,475129,997,551101,296,0001,002,0002,453,504
6Mar 4, 2026 00:2512,479126,098,77799,319,0003,009,0002,461,696
7Mar 4, 2026 00:2512,487128,772,717101,388,0001,003,0002,449,408
8Mar 4, 2026 00:2512,493125,439,040102,445,00002,453,504
9Mar 4, 2026 00:2512,638129,459,014103,634,00002,445,312