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 22, 2026 08:15olliecrowolliecrowScore: 22,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 08:163,35647,612,98826,506,0001,019,0002,490,368
2Apr 22, 2026 08:1622,766206,798,216183,694,0002,995,0002,490,368
3Apr 22, 2026 08:1622,791206,241,732183,891,0002,998,0002,531,328
4Apr 22, 2026 08:1622,806202,013,326184,016,0003,000,0002,482,176
5Apr 22, 2026 08:1622,811211,369,874184,058,0003,000,0002,502,656
6Apr 22, 2026 08:1622,817208,122,210183,100,0004,002,0002,424,832
7Apr 22, 2026 08:1622,839205,443,620185,284,0002,003,0002,482,176
8Apr 22, 2026 08:1622,854203,230,908185,405,0002,004,0002,494,464
9Apr 22, 2026 08:1622,914209,056,498184,902,0002,998,0002,387,968