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 24, 2026 00:05olliecrowolliecrowScore: 17,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 00:0617,228154,944,150139,267,0002,003,0002,334,720
2Apr 24, 2026 00:0617,238159,450,703139,353,0002,005,0002,330,624
3Apr 24, 2026 00:0617,244162,218,645138,398,0003,008,0002,367,488
4Apr 24, 2026 00:0617,264159,079,087136,586,0004,984,0002,363,392
5Apr 24, 2026 00:0617,286160,105,906138,755,0002,994,0002,359,296
6Apr 24, 2026 00:0617,287160,538,077139,765,0001,996,0002,367,488
7Apr 24, 2026 00:0617,288158,411,595138,771,0002,995,0002,355,200
8Apr 24, 2026 00:0617,298160,170,055138,848,0002,996,0002,355,200
9Apr 24, 2026 00:0617,365164,665,593141,399,0001,002,0002,359,296