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 10, 2026 21:51olliecrowolliecrowScore: 10,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:519,886106,274,70678,067,0003,002,0002,449,408
2Mar 10, 2026 21:5110,220111,369,54982,806,000997,0002,437,120
3Mar 10, 2026 21:5115,148150,915,701120,208,0004,006,0002,465,792