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 listMay 7, 2026 20:23Pavel SkripkinPavel SkripkinScore: 6,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 20:236,63171,406,82846,480,0007,899,0002,363,392
2May 7, 2026 20:236,64372,009,21146,417,0008,056,0002,494,464
3May 7, 2026 20:236,64670,024,80246,290,0008,208,0002,306,048
4May 7, 2026 20:236,66070,361,41746,636,0007,978,0002,490,368
5May 7, 2026 20:236,75968,812,27446,984,0008,441,0002,523,136
6May 7, 2026 20:236,77877,735,78947,098,0008,483,0002,404,352
7May 7, 2026 20:236,90771,610,22247,388,0009,255,0002,396,160
8May 7, 2026 20:236,97372,374,59848,020,0009,161,0002,416,640
9May 7, 2026 20:237,09574,782,14148,873,0009,310,0002,396,160