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:04Victor MerckléVictor MerckléScore: 2,778Success
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:052,73630,563,88121,333,0001,109,0002,117,632stderr
2Aug 23, 2026 14:052,75930,983,61721,594,0001,033,0002,117,632stderr
3Aug 23, 2026 14:052,76730,846,42621,668,0001,024,0002,117,632stderr
4Aug 23, 2026 14:052,77831,149,19521,717,0001,065,0002,117,632stderr
5Aug 23, 2026 14:052,77831,077,61121,761,0001,024,0002,117,632stderr
6Aug 23, 2026 14:052,86832,570,73122,325,0001,193,0002,117,632stderr
7Aug 23, 2026 14:055,40052,552,14843,135,0001,148,0002,117,632stderr
8Aug 23, 2026 14:055,44953,126,04743,569,0001,116,0002,117,632stderr
9Aug 23, 2026 14:0514,530127,242,066117,931,0001,221,0002,117,632stderr