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 23:54Tomislav TunkovicTomislav TunkovicScore: 2,701Success
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 23:542,69231,192,09520,951,0001,128,0002,113,536
2Aug 14, 2026 23:542,69731,221,46521,004,0001,119,0002,113,536
3Aug 14, 2026 23:542,69831,239,60020,988,0001,137,0002,113,536
4Aug 14, 2026 23:542,69930,640,54821,015,0001,118,0002,113,536
5Aug 14, 2026 23:542,70130,410,80821,016,0001,136,0002,113,536
6Aug 14, 2026 23:542,70130,600,50221,027,0001,125,0002,113,536
7Aug 14, 2026 23:542,70630,755,74421,166,0001,026,0002,113,536
8Aug 14, 2026 23:542,78031,894,65321,665,0001,133,0002,113,536
9Aug 14, 2026 23:545,50753,713,61444,058,0001,104,0002,113,536