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 09:23marko1597marko1597Score: 2,823Success
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 09:502,81331,279,84022,036,0001,035,0002,117,632stderr
2Aug 16, 2026 09:502,81431,265,76621,798,0001,279,0002,117,632stderr
3Aug 16, 2026 09:502,81632,704,53421,814,0001,285,0002,117,632stderr
4Aug 16, 2026 09:502,82331,587,64021,872,0001,284,0002,117,632stderr
5Aug 16, 2026 09:502,82331,659,38621,964,0001,192,0002,117,632stderr
6Aug 16, 2026 09:502,82631,972,16021,901,0001,280,0002,117,632stderr
7Aug 16, 2026 09:502,84731,502,18622,325,0001,027,0002,117,632stderr
8Aug 16, 2026 09:506,92265,208,21455,606,0001,160,0002,117,632stderr
9Aug 16, 2026 09:507,11366,811,01557,146,0001,182,0002,117,632stderr