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 20:50olliecrowolliecrowScore: 23,308Success
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 20:5117,539158,263,677140,829,0002,996,0002,555,904
2Apr 22, 2026 20:5117,641162,356,235141,667,0002,992,0002,322,432
3Apr 22, 2026 20:5123,283205,230,743185,925,0004,997,0002,457,600
4Apr 22, 2026 20:5123,284208,618,905187,937,0002,999,0002,424,832
5Apr 22, 2026 20:5123,308209,889,745185,129,0006,004,0002,396,160
6Apr 22, 2026 20:5123,328210,361,246188,289,0003,004,0002,457,600
7Apr 22, 2026 20:5123,335208,569,671188,346,0003,005,0002,379,776
8Apr 22, 2026 20:5123,345213,254,113187,422,0004,009,0002,412,544
9Apr 22, 2026 20:5123,352211,269,006187,499,0003,989,0002,400,256