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:00Kevin HeaveyKevin HeaveyError
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:000134,542,569123,254,0001,005,00020,480Exit with code 3: ..[2:95-9e/50/0]...[6:0-3e/49/0]...............[22:9a-ad/49/0]..............................[53:71-cd/49/0]......[60:4-f7/50/0]..[63:3e-9e/49/0].......[71:4a-73/49/0]....[76:35-d0/49/0].....................[98:11-a0/50/0].stderr