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 listApr 25, 2026 06:18olliecrowolliecrowScore: 3,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 06:213,60244,768,35827,502,0002,037,0002,351,104stderr
2Apr 25, 2026 06:213,60537,771,46328,547,0001,019,0002,404,352stderr
3Apr 25, 2026 06:213,63246,010,73626,811,0002,979,0002,506,752stderr
4Apr 25, 2026 06:213,65338,286,52026,963,0002,995,0002,555,904stderr
5Apr 25, 2026 06:213,66838,455,78128,080,0002,005,0002,531,328stderr
6Apr 25, 2026 06:2135,309298,098,320283,549,0005,990,0002,437,120stderr
7Apr 25, 2026 06:2135,346298,267,911284,843,0004,997,0002,387,968stderr
8Apr 25, 2026 06:2135,438299,075,048287,598,0002,995,0002,379,776stderr
9Apr 25, 2026 06:2135,447308,285,447285,679,0004,994,0002,523,136stderr