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 listAug 16, 2026 08:12marko1597marko1597Score: 2,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 08:502,81031,256,12521,858,0001,190,0002,117,632stderr
2Aug 16, 2026 08:502,82132,747,51521,853,0001,285,0002,117,632stderr
3Aug 16, 2026 08:502,82431,546,89721,998,0001,165,0002,117,632stderr
4Aug 16, 2026 08:502,82531,332,70521,886,0001,280,0002,117,632stderr
5Aug 16, 2026 08:502,83731,704,68822,086,0001,181,0002,117,632stderr
6Aug 16, 2026 08:502,84231,821,79622,019,0001,292,0002,117,632stderr
7Aug 16, 2026 08:506,95365,376,23755,903,0001,118,0002,117,632stderr
8Aug 16, 2026 08:506,98365,632,89056,145,0001,122,0002,117,632stderr
9Aug 16, 2026 08:507,02166,064,43056,451,0001,123,0002,117,632stderr