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 1, 2026 17:54Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 17:550126,067,775101,895,0002,996,0002,428,928expected "2172933721 ", got "2194113750 "
2May 1, 2026 17:5512,716124,909,618101,269,0003,007,0002,326,528
3May 1, 2026 17:5512,728122,109,718101,362,0003,010,0002,424,832
4May 1, 2026 17:5512,756117,945,869102,592,0002,011,0002,318,336
5May 1, 2026 17:5512,767121,553,43099,712,0004,985,0002,424,832
6May 1, 2026 17:5512,771124,153,432101,732,0002,992,0002,326,528
7May 1, 2026 17:5512,781118,636,513101,817,0002,994,0002,428,928
8May 1, 2026 17:5512,797120,605,507101,940,0002,998,0002,420,736
9May 1, 2026 17:5512,811119,716,905103,033,0002,020,0002,416,640