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 12:59Victor MerckléVictor MerckléScore: 6,165Success
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 13:013,16134,861,21724,909,0001,012,0002,117,632stderr
2Aug 29, 2026 13:013,16734,258,62424,954,0001,019,0002,117,632stderr
3Aug 29, 2026 13:013,18335,056,47125,087,0001,019,0002,117,632stderr
4Aug 29, 2026 13:016,15060,205,65849,299,0001,131,0002,117,632stderr
5Aug 29, 2026 13:016,16559,534,46349,388,0001,167,0002,117,632stderr
6Aug 29, 2026 13:016,17559,007,77449,513,0001,127,0002,117,632stderr
7Aug 29, 2026 13:016,17659,550,74349,528,0001,119,0002,117,632stderr
8Aug 29, 2026 13:016,19259,135,96949,658,0001,119,0002,117,632stderr
9Aug 29, 2026 13:016,25359,606,91450,256,0001,025,0002,117,632stderr