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 listDec 26, 2025 04:07Josu San MartinJosu San MartinScore: 17,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 04:0717,422168,420,036140,845,0002,012,0002,355,200
2Dec 26, 2025 04:0717,422167,102,361140,862,0001,998,0002,355,200
3Dec 26, 2025 04:0717,458168,909,518141,152,0002,002,0002,408,448