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 16, 2026 11:48marko1597marko1597Score: 2,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 11:552,73130,870,19121,274,0001,121,0002,117,632stderr
2Aug 16, 2026 11:552,73330,890,71421,299,0001,118,0002,117,632stderr
3Aug 16, 2026 11:552,73530,879,27421,302,0001,125,0002,117,632stderr
4Aug 16, 2026 11:552,73830,881,10521,333,0001,121,0002,117,632stderr
5Aug 16, 2026 11:552,74531,005,57121,389,0001,126,0002,117,632stderr
6Aug 16, 2026 11:556,96965,385,80856,093,0001,053,0002,117,632stderr
7Aug 16, 2026 11:556,97165,385,47656,000,0001,164,0002,117,632stderr
8Aug 16, 2026 11:556,97565,619,19156,159,0001,037,0002,117,632stderr
9Aug 16, 2026 11:556,97865,778,05656,200,0001,022,0002,117,632stderr