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 14:37Victor MerckléVictor MerckléScore: 2,809Success
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 14:382,79331,091,63421,723,0001,185,0002,117,632stderr
2Aug 19, 2026 14:382,79931,087,75621,803,0001,154,0002,117,632stderr
3Aug 19, 2026 14:382,80032,046,82221,838,0001,130,0002,117,632stderr
4Aug 19, 2026 14:382,80631,993,24321,874,0001,142,0002,117,632stderr
5Aug 19, 2026 14:382,80931,441,98321,933,0001,107,0002,117,632stderr
6Aug 19, 2026 14:382,82131,302,87321,999,0001,134,0002,117,632stderr
7Aug 19, 2026 14:385,49553,469,22244,050,0001,017,0002,117,632stderr
8Aug 19, 2026 14:385,50253,494,40444,107,0001,017,0002,117,632stderr
9Aug 19, 2026 14:385,54253,830,86844,429,0001,017,0002,117,632stderr