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 10, 2026 10:16Pavel SkripkinPavel SkripkinScore: 24,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:164,09146,346,03830,379,0003,175,0002,306,048
2May 10, 2026 10:164,09849,132,22530,309,0003,298,0002,535,424
3May 10, 2026 10:164,13146,387,45730,596,0003,279,0002,441,216
4May 10, 2026 10:164,19249,356,15030,742,0003,633,0002,490,368
5May 10, 2026 10:1624,933222,375,516201,199,0003,258,0002,478,080
6May 10, 2026 10:1625,266219,638,618203,904,0003,278,0002,314,240
7May 10, 2026 10:1625,270221,073,535203,887,0003,333,0002,347,008
8May 10, 2026 10:1625,382223,966,637205,010,0003,123,0002,441,216
9May 10, 2026 10:1625,541224,048,745206,312,0003,130,0002,527,232