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 listJun 28, 2026 06:53Victor MerckléVictor MerckléScore: 20,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 06:5411,231100,074,97790,928,0001,174,0002,117,632stderr
2Jun 28, 2026 06:5411,249100,104,83591,242,0001,007,0002,117,632stderr
3Jun 28, 2026 06:5411,294100,445,48991,609,0001,007,0002,117,632stderr
4Jun 28, 2026 06:5411,297100,416,76391,437,0001,200,0002,117,632stderr
5Jun 28, 2026 06:5420,159173,096,387164,302,0001,004,0002,117,632stderr
6Jun 28, 2026 06:5420,199173,458,348164,628,0001,005,0002,117,632stderr
7Jun 28, 2026 06:5420,285174,190,422165,339,0001,004,0002,117,632stderr
8Jun 28, 2026 06:5420,290174,224,375165,378,0001,005,0002,117,632stderr
9Jun 28, 2026 06:5420,313174,409,832165,562,0001,005,0002,117,632stderr