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 5, 2026 08:55Rajarshi BasuRajarshi BasuScore: 5,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 08:555,06966,862,40836,497,0005,069,0002,322,432
2Jan 5, 2026 08:555,11260,742,80237,929,0003,992,0002,351,104
3Jan 5, 2026 08:555,12171,888,30638,994,0002,999,0002,449,408
4Jan 5, 2026 08:555,25969,989,91633,095,00010,029,0002,355,200
5Jan 5, 2026 08:5572,782626,017,708463,080,000133,734,0002,293,760
6Jan 5, 2026 08:5588,109750,610,854592,944,000129,550,0002,281,472