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 listSep 4, 2026 06:40Josu San MartinJosu San MartinScore: 3,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 06:413,01934,645,70223,712,0001,050,0002,121,728stderr
2Sep 4, 2026 06:413,05835,014,44624,030,0001,051,0002,121,728stderr
3Sep 4, 2026 06:413,06435,921,97924,072,0001,054,0002,121,728stderr
4Sep 4, 2026 06:413,06635,712,44124,110,0001,033,0002,121,728stderr
5Sep 4, 2026 06:413,06735,144,24224,123,0001,034,0002,121,728stderr
6Sep 4, 2026 06:413,07135,800,06424,130,0001,054,0002,121,728stderr
7Sep 4, 2026 06:413,07635,820,72124,172,0001,056,0002,121,728stderr
8Sep 4, 2026 06:413,08035,192,84824,223,0001,034,0002,121,728stderr
9Sep 4, 2026 06:4115,228134,890,240123,860,0001,014,0002,121,728stderr