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 listJan 2, 2026 04:41Rajarshi BasuRajarshi BasuScore: 10,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:429,156106,875,00370,071,0005,005,0002,306,048
2Jan 2, 2026 04:4110,217112,518,70979,794,0003,989,0002,310,144
3Jan 2, 2026 04:4210,352112,114,23080,895,0003,994,0002,375,680
4Jan 2, 2026 04:4110,581117,278,47977,789,0008,975,0002,494,464
5Jan 2, 2026 04:4195,824814,131,717664,794,000120,962,0002,437,120
6Jan 2, 2026 04:42103,119871,401,004734,632,000110,944,0002,301,952