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 12, 2026 21:36Josu San MartinJosu San MartinScore: 11,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 21:363,29553,155,75626,019,0001,000,0002,486,272
2Mar 12, 2026 21:3611,205119,198,70189,884,0001,997,0002,404,352
3Mar 12, 2026 21:3611,214117,536,46089,959,0001,999,0002,510,848
4Mar 12, 2026 21:3611,223113,142,77089,030,0003,001,0002,408,448
5Mar 12, 2026 21:3611,224113,690,98791,036,0001,000,0002,473,984
6Mar 12, 2026 21:3611,258114,650,93190,307,0002,006,0002,326,528