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 listMar 20, 2026 03:41olliecrowolliecrowScore: 22,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 03:413,32249,615,75925,226,0002,018,0002,449,408
2Mar 20, 2026 03:413,32551,032,39025,249,0002,019,0002,289,664
3Mar 20, 2026 03:413,34350,282,45226,395,0001,015,0002,502,656
4Mar 20, 2026 03:413,41158,405,51125,971,0001,997,0002,367,488
5Mar 20, 2026 03:4122,730214,063,508183,380,0003,006,0002,269,184
6Mar 20, 2026 03:4122,761213,817,720184,647,0001,996,0002,478,080
7Mar 20, 2026 03:4122,787211,449,857183,854,0002,997,0002,297,856
8Mar 20, 2026 03:4122,810214,124,883185,038,0002,000,0002,469,888
9Mar 20, 2026 03:4122,866215,992,075184,511,0002,992,0002,400,256