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 19:30Andrew EpsteinAndrew EpsteinScore: 17,794Success
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 19:312,67830,746,73721,964,000020,480
2Sep 19, 2026 19:312,69130,800,30622,069,000020,480
3Sep 19, 2026 19:3117,190151,112,233140,958,000020,480
4Sep 19, 2026 19:3117,303150,783,424141,892,000020,480
5Sep 19, 2026 19:3117,794155,396,110145,917,000020,480
6Sep 19, 2026 19:3117,813154,829,562146,074,000020,480
7Sep 19, 2026 19:3117,847155,144,532146,349,000020,480
8Sep 19, 2026 19:3117,848155,782,345146,359,000020,480
9Sep 19, 2026 19:3118,084157,814,947148,290,000020,480