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 listMar 12, 2026 22:05Josu San MartinJosu San MartinScore: 3,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 22:053,61556,410,01328,622,0001,022,0002,428,928
2Mar 12, 2026 22:053,64056,202,97326,866,0002,985,0002,486,272
3Mar 12, 2026 22:053,64456,838,68427,822,0002,060,0002,457,600