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 4, 2025 23:38AntonAntonScore: 23,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 23:3822,980212,615,487186,433,0002,004,0002,318,336
2Nov 4, 2025 23:3822,999219,054,282185,598,0002,993,0002,514,944
3Nov 4, 2025 23:3823,006213,716,879186,654,0001,996,0002,560,000
4Nov 4, 2025 23:3823,040210,306,728185,927,0002,998,0002,297,856
5Nov 4, 2025 23:3823,041217,607,438185,936,0002,998,0002,523,136
6Nov 4, 2025 23:3823,057222,917,340188,066,0001,000,0002,527,232
7Nov 4, 2025 23:3823,118218,073,754188,568,000997,0002,297,856
8Nov 4, 2025 23:3823,119217,076,184188,581,000997,0002,527,232
9Nov 4, 2025 23:3823,177218,163,316188,049,0002,000,0002,297,856