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:14Victor MerckléVictor MerckléScore: 2,771Success
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 16:152,74530,754,42821,421,0001,088,0002,117,632stderr
2Aug 19, 2026 16:152,76230,926,77421,631,0001,020,0002,117,632stderr
3Aug 19, 2026 16:152,76630,944,76721,668,0001,021,0002,117,632stderr
4Aug 19, 2026 16:152,77030,984,87421,694,0001,026,0002,117,632stderr
5Aug 19, 2026 16:152,77131,754,53721,706,0001,023,0002,117,632stderr
6Aug 19, 2026 16:152,83732,215,63422,093,0001,174,0002,117,632stderr
7Aug 19, 2026 16:155,40653,303,02643,055,0001,281,0002,117,632stderr
8Aug 19, 2026 16:155,41552,595,32043,276,0001,135,0002,117,632stderr
9Aug 19, 2026 16:155,42052,730,59543,320,0001,132,0002,117,632stderr