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 3, 2026 19:49Josu San MartinJosu San MartinScore: 158,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 19:49145,9014,209,518,650163,097,0001,033,288,000339,968
2Mar 3, 2026 05:38148,1954,217,589,847185,300,0001,029,899,000290,816
3Mar 3, 2026 05:38157,2954,208,413,818291,879,000997,940,000184,320
4Mar 3, 2026 19:49158,1784,240,182,355284,549,0001,012,514,000319,488
5Mar 3, 2026 19:49158,8304,586,409,496284,646,0001,017,764,000282,624
6Mar 3, 2026 05:38160,3484,839,594,358280,380,0001,034,470,000274,432