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 4, 2026 00:38olliecrowolliecrowScore: 12,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:3812,207128,992,72098,098,0002,002,0002,412,544
2Mar 4, 2026 00:3812,216125,810,63396,163,0004,006,0002,433,024
3Mar 4, 2026 00:3812,220124,011,05598,199,0002,004,0002,416,640
4Mar 4, 2026 00:3812,222130,960,74599,219,0001,002,0002,404,352
5Mar 4, 2026 00:3812,225126,636,75098,239,0002,004,0002,457,600
6Mar 4, 2026 00:3812,226124,471,68698,246,0002,005,0002,457,600
7Mar 4, 2026 00:3812,248122,164,88399,431,0001,004,0002,404,352
8Mar 4, 2026 00:3812,252123,108,33498,460,0002,009,0002,523,136
9Mar 4, 2026 00:3812,297126,658,28696,845,0003,993,0002,453,504