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 listFeb 19, 2026 12:57Aleksei ShahoikaAleksei ShahoikaScore: 95,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 12:574,52558,657,47534,094,0003,008,0002,424,832
2Feb 19, 2026 12:574,58866,669,86136,605,0001,016,0002,404,352
3Feb 19, 2026 12:574,65960,574,64236,192,0002,010,0002,281,472
4Feb 19, 2026 12:5789,568758,991,619619,541,000114,914,0002,281,472
5Feb 19, 2026 12:5795,441813,284,603657,678,000124,938,0002,347,008
6Feb 19, 2026 12:5797,551825,189,283687,073,000112,847,0002,285,568
7Feb 19, 2026 12:5798,757838,652,921686,988,000122,819,0002,281,472
8Feb 19, 2026 12:57102,827867,892,493712,312,000130,873,0002,342,912
9Feb 19, 2026 12:57115,888987,436,327817,383,000132,899,0002,351,104