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 listAug 14, 2026 19:50Tomislav TunkovicTomislav TunkovicScore: 4,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:024,01141,965,83931,834,0001,059,0002,121,728stderr
2Aug 14, 2026 20:024,02041,330,74131,910,0001,058,0002,121,728stderr
3Aug 14, 2026 20:024,02041,406,27631,939,0001,029,0002,121,728stderr
4Aug 14, 2026 20:024,02942,166,91131,976,0001,062,0002,121,728stderr
5Aug 14, 2026 20:024,03141,402,01332,029,0001,032,0002,121,728stderr
6Aug 14, 2026 20:024,03641,480,08632,069,0001,029,0002,121,728stderr
7Aug 14, 2026 20:024,03641,458,41332,068,0001,035,0002,121,728stderr
8Aug 14, 2026 20:024,04241,470,94332,113,0001,034,0002,121,728stderr
9Aug 14, 2026 20:024,05243,719,55432,196,0001,031,0002,121,728stderr