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 21:37olliecrowolliecrowScore: 3,419Success
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 21:373,40247,308,25624,802,0003,100,0002,543,616
2Apr 28, 2026 21:373,40743,804,33024,951,0002,994,0002,539,520
3Apr 28, 2026 21:373,40947,599,45425,961,0001,997,0002,519,040
4Apr 28, 2026 21:373,41544,993,94825,006,0003,000,0002,519,040
5Apr 28, 2026 21:373,41945,952,23126,038,0002,002,0002,482,176
6Apr 28, 2026 21:373,46347,732,32826,375,0002,028,0002,416,640
7Apr 28, 2026 21:373,46946,533,19527,433,0001,016,0002,428,928
8Apr 28, 2026 21:3723,865214,959,176191,702,0003,993,0002,560,000
9Apr 28, 2026 21:3724,130221,814,920194,869,0002,997,0002,351,104