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 23, 2026 19:42Victor MerckléVictor MerckléScore: 2,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:432,73830,902,72221,351,0001,108,0002,117,632stderr
2Aug 23, 2026 19:432,75230,886,53021,485,0001,083,0002,117,632stderr
3Aug 23, 2026 19:432,76231,025,65721,632,0001,018,0002,117,632stderr
4Aug 23, 2026 19:432,76531,696,65621,645,0001,036,0002,117,632stderr
5Aug 23, 2026 19:432,76631,045,54921,514,0001,173,0002,117,632stderr
6Aug 23, 2026 19:432,77331,108,20021,687,0001,054,0002,117,632stderr
7Aug 23, 2026 19:435,37952,458,05743,062,0001,053,0002,117,632stderr
8Aug 23, 2026 19:435,47553,271,75343,693,0001,209,0002,117,632stderr
9Aug 23, 2026 19:435,51762,398,64044,055,0001,190,0002,117,632stderr