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 listNov 8, 2026 13:08janwwwjanwwwScore: 3,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 13:093,08034,584,54324,206,0001,056,00020,480
2Nov 8, 2026 13:093,08034,563,49724,207,0001,052,00020,480
3Nov 8, 2026 13:093,08434,487,50824,232,0001,058,00020,480
4Nov 8, 2026 13:093,08934,636,53724,276,0001,054,00020,480
5Nov 8, 2026 13:093,10634,776,61124,456,0001,019,00020,480
6Nov 8, 2026 13:093,11134,757,69824,494,0001,023,00020,480
7Nov 8, 2026 13:093,15236,593,96524,829,0001,022,00020,480
8Nov 8, 2026 13:093,15835,198,39824,877,0001,024,00020,480
9Nov 8, 2026 13:093,16235,236,73724,903,0001,026,00020,480