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:05olliecrowolliecrowScore: 18,520Success
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:0518,184176,260,936145,105,0004,002,0002,277,376
2Mar 4, 2026 00:0518,520182,659,961149,867,0001,998,0002,482,176
3Mar 4, 2026 00:0518,623176,535,763149,717,0002,994,0002,482,176