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 27, 2025 12:04Rajarshi BasuRajarshi BasuScore: 22,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 12:0422,518210,693,488183,646,000998,0002,523,136
2Dec 27, 2025 12:0422,706208,125,557186,193,00002,519,040
3Dec 27, 2025 12:0422,759210,485,344185,626,000997,0002,387,968
4Dec 27, 2025 12:0422,760213,066,226185,637,000998,0002,519,040
5Dec 27, 2025 12:0422,878214,424,230187,603,00002,392,064
6Dec 27, 2025 12:0423,032214,856,312187,862,000999,0002,523,136
7Dec 27, 2025 12:0423,079213,753,198188,243,0001,001,0002,510,848
8Dec 27, 2025 12:0423,099215,801,129188,406,0001,002,0002,519,040
9Dec 27, 2025 12:0423,618222,347,259191,670,0001,996,0002,519,040