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 28, 2026 19:30olliecrowolliecrowScore: 3,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 19:323,72647,017,74829,540,0001,018,0002,461,696
2Apr 28, 2026 19:323,75745,542,79529,816,000993,0002,330,624
3Apr 28, 2026 19:323,77750,653,43628,980,0001,998,0002,453,504
4Apr 28, 2026 19:323,79650,051,24428,118,0003,012,0002,306,048
5Apr 28, 2026 19:323,79747,839,79428,128,0003,013,0002,412,544
6Apr 28, 2026 19:323,79851,896,49629,135,0002,009,0002,449,408
7Apr 28, 2026 19:323,84052,415,17629,458,0002,031,0002,523,136
8Apr 28, 2026 19:323,91950,987,58530,130,0002,008,0002,330,624
9Apr 28, 2026 19:323,97254,828,32629,519,0003,053,0002,330,624