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 23, 2026 16:02Dominique GarmierDominique GarmierScore: 19,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 16:0219,010178,234,48667,948,00087,932,0002,408,448
2Mar 23, 2026 16:0219,020179,612,46862,987,00092,981,0002,322,432
3Mar 23, 2026 16:0219,132183,275,93769,948,00086,936,0002,433,024