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 listJul 6, 2025 08:54Valentin KofmanValentin KofmanScore: 28,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 08:5427,703251,381,179225,162,0002,001,0002,404,352
2Jul 6, 2025 08:5428,012255,906,864229,697,00002,273,280
3Jul 6, 2025 08:5428,110259,852,616229,502,0001,002,0002,392,064
4Jul 6, 2025 08:5428,144252,271,707229,781,000999,0002,392,064
5Jul 6, 2025 08:5428,618256,377,745233,669,000998,0002,404,352
6Jul 6, 2025 08:5428,751262,368,949233,759,0001,997,0002,273,280
7Jul 6, 2025 08:5428,886258,882,385234,869,0001,998,0002,510,848
8Jul 6, 2025 08:5429,068267,179,777238,356,00002,273,280
9Jul 6, 2025 08:5429,292269,602,039240,193,00002,404,352