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 listMar 10, 2026 20:37olliecrowolliecrowScore: 10,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 20:3710,347111,775,96482,824,0002,020,0002,486,272
2Mar 10, 2026 20:3710,390111,076,77383,194,0002,004,0002,273,280
3Mar 10, 2026 20:3710,404109,337,71283,308,0002,007,0002,420,736
4Mar 10, 2026 20:3710,443114,096,67583,617,0002,014,0002,506,752
5Mar 10, 2026 20:3710,464113,212,79583,813,0001,995,0002,387,968
6Mar 10, 2026 20:3710,486111,918,88983,990,0001,999,0002,404,352
7Mar 10, 2026 20:3710,660114,449,08883,391,0004,018,0002,412,544
8Mar 10, 2026 20:3711,020116,338,21388,357,0002,008,0002,310,144
9Mar 10, 2026 20:3715,576156,565,270123,734,0003,991,0002,375,680