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 22, 2026 02:24olliecrowolliecrowScore: 29,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 02:2428,720253,898,393233,511,0001,995,0002,355,200
2Apr 22, 2026 02:2428,792253,200,869234,096,0002,000,0002,347,008
3Apr 22, 2026 02:2428,831253,523,273235,419,0001,001,0002,347,008
4Apr 22, 2026 02:2429,107256,048,284236,682,0001,997,0002,347,008
5Apr 22, 2026 02:2429,139255,590,403236,947,0001,999,0002,347,008
6Apr 22, 2026 02:2429,890260,325,915244,100,0001,000,0002,347,008
7Apr 22, 2026 02:2429,913263,032,912244,293,0001,001,0002,338,816
8Apr 22, 2026 02:2430,211262,437,481245,741,0001,997,0002,338,816
9Apr 22, 2026 02:2432,639286,104,580265,647,0001,997,0002,347,008