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 listOct 15, 2026 01:28highload-churnerhighload-churnerScore: 2,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 01:292,48629,402,66920,392,000020,480
2Oct 15, 2026 01:292,48929,459,24520,415,000020,480
3Oct 15, 2026 01:292,49229,419,13320,441,000020,480
4Oct 15, 2026 01:292,49229,475,23220,442,000020,480
5Oct 15, 2026 01:292,49329,513,84020,450,000020,480
6Oct 15, 2026 01:292,49429,448,84220,453,000020,480
7Oct 15, 2026 01:292,49429,439,54220,457,000020,480
8Oct 15, 2026 01:295,83556,824,00544,557,0003,290,00020,480
9Oct 15, 2026 01:295,83857,363,98444,616,0003,256,00020,480