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 19, 2026 16:56Victor MerckléVictor MerckléScore: 5,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 17:082,84531,601,89322,251,0001,084,0002,117,632stderr
2Aug 19, 2026 17:082,85231,536,87822,288,0001,103,0002,117,632stderr
3Aug 19, 2026 17:082,85531,569,65322,332,0001,085,0002,117,632stderr
4Aug 19, 2026 17:085,49953,282,18044,075,0001,023,0002,117,632stderr
5Aug 19, 2026 17:085,50553,464,04344,119,0001,026,0002,117,632stderr
6Aug 19, 2026 17:085,50953,294,71344,034,0001,145,0002,117,632stderr
7Aug 19, 2026 17:085,51353,303,77444,172,0001,036,0002,117,632stderr
8Aug 19, 2026 17:085,52253,552,11944,150,0001,131,0002,117,632stderr
9Aug 19, 2026 17:085,57454,804,23944,501,0001,208,0002,117,632stderr