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 24, 2026 07:47Kevin HeaveyKevin HeaveyScore: 2,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 07:532,56229,702,62920,012,0001,004,00020,480
2Sep 24, 2026 07:532,56329,746,47319,999,0001,025,00020,480
3Sep 24, 2026 07:532,56530,588,76520,030,0001,006,00020,480
4Sep 24, 2026 07:532,57030,063,53020,075,0001,006,00020,480
5Sep 24, 2026 07:532,57130,531,37420,062,0001,026,00020,480
6Sep 24, 2026 07:532,58329,863,48020,180,0001,006,00020,480
7Sep 24, 2026 07:532,58729,913,19320,213,0001,008,00020,480
8Sep 24, 2026 07:532,61031,962,97120,380,0001,022,00020,480
9Sep 24, 2026 07:537,61771,779,90360,429,0002,031,00020,480