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 14:56Victor MerckléVictor MerckléScore: 3,280Success
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 14:573,25734,924,70925,606,0001,107,0002,117,632stderr
2Aug 23, 2026 14:573,26435,786,65125,746,0001,026,0002,117,632stderr
3Aug 23, 2026 14:573,26735,107,20925,773,0001,018,0002,117,632stderr
4Aug 23, 2026 14:573,26935,047,68125,788,0001,024,0002,117,632stderr
5Aug 23, 2026 14:573,28035,213,93525,869,0001,027,0002,117,632stderr
6Aug 23, 2026 14:573,30236,008,23026,030,0001,052,0002,117,632stderr
7Aug 23, 2026 14:575,92956,830,98647,503,0001,120,0002,117,632stderr
8Aug 23, 2026 14:575,93157,653,02047,513,0001,124,0002,117,632stderr
9Aug 23, 2026 14:5714,765129,224,559120,046,0001,032,0002,117,632stderr