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 19, 2026 13:45Victor MerckléVictor MerckléScore: 5,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 13:512,82131,338,67422,095,0001,041,0002,117,632stderr
2Aug 19, 2026 13:512,84531,600,71222,074,0001,255,0002,117,632stderr
3Aug 19, 2026 13:512,85632,453,79522,359,0001,067,0002,117,632stderr
4Aug 19, 2026 13:512,85931,604,14822,386,0001,060,0002,117,632stderr
5Aug 19, 2026 13:515,46753,907,40343,608,0001,229,0002,117,632stderr
6Aug 19, 2026 13:5114,349125,829,539116,521,0001,148,0002,117,632stderr
7Aug 19, 2026 13:5114,449128,218,458117,284,0001,203,0002,117,632stderr
8Aug 19, 2026 13:5114,489127,182,685117,589,0001,228,0002,117,632stderr
9Aug 19, 2026 13:5114,981131,131,061121,698,0001,153,0002,117,632stderr