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 29, 2026 10:05Victor MerckléVictor MerckléScore: 2,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 10:062,73730,814,62021,358,0001,092,0002,117,632stderr
2Aug 29, 2026 10:062,75231,971,01121,398,0001,169,0002,117,632stderr
3Aug 29, 2026 10:062,75430,935,02721,504,0001,084,0002,117,632stderr
4Aug 29, 2026 10:062,75430,946,67921,573,0001,010,0002,117,632stderr
5Aug 29, 2026 10:062,76231,621,08421,630,0001,020,0002,117,632stderr
6Aug 29, 2026 10:065,37752,406,01543,048,0001,046,0002,117,632stderr
7Aug 29, 2026 10:065,39752,647,39243,169,0001,088,0002,117,632stderr
8Aug 29, 2026 10:065,41552,974,78843,281,0001,126,0002,117,632stderr
9Aug 29, 2026 10:065,41652,796,00343,302,0001,111,0002,117,632stderr