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 22, 2026 23:05Victor MerckléVictor MerckléScore: 3,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 23:053,20733,724,22925,245,0001,053,0002,113,536
2Jun 22, 2026 23:053,21233,804,99725,281,0001,061,0002,113,536
3Jun 22, 2026 23:053,21633,787,97325,312,0001,066,0002,113,536
4Jun 22, 2026 23:053,21733,795,86825,317,0001,064,0002,113,536
5Jun 22, 2026 23:053,22233,826,78125,353,0001,071,0002,113,536
6Jun 22, 2026 23:053,24034,007,32325,501,0001,074,0002,113,536
7Jun 22, 2026 23:053,25134,040,62125,588,0001,072,0002,113,536
8Jun 22, 2026 23:053,25534,114,10725,660,0001,038,0002,113,536
9Jun 22, 2026 23:0512,060106,323,92397,879,0001,013,0002,113,536