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 31, 2026 06:14TonyTonyScore: 1,000,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 06:20999,2488,204,056,6658,041,636,000152,205,0002,113,536
2Jul 31, 2026 06:201,000,7318,216,987,2978,058,481,000147,518,0002,113,536
3Jul 31, 2026 06:201,005,3968,256,658,2088,095,328,000148,920,0002,113,536