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 listSep 19, 2026 18:38Andrew EpsteinAndrew EpsteinScore: 17,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:392,66231,271,94421,830,000020,480
2Sep 19, 2026 18:392,67430,686,26421,927,000020,480
3Sep 19, 2026 18:392,67430,694,39421,927,000020,480
4Sep 19, 2026 18:392,67630,770,93221,949,000020,480
5Sep 19, 2026 18:3917,193149,700,567140,983,000020,480
6Sep 19, 2026 18:3917,221149,936,021141,217,000020,480
7Sep 19, 2026 18:3917,715154,196,337145,263,000020,480
8Sep 19, 2026 18:3917,725154,169,642145,348,000020,480
9Sep 19, 2026 18:3918,306158,916,412150,112,000020,480