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 listJan 18, 2026 06:40Josu San MartinJosu San MartinScore: 20,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 06:4020,100192,876,379134,854,00029,967,0002,383,872
2Jan 18, 2026 06:4020,402190,193,116132,237,00035,063,0002,486,272
3Jan 18, 2026 06:4020,720199,972,334137,923,00031,982,0002,469,888