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 16, 2026 11:06Dominique GarmierDominique GarmierScore: 138,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 11:06135,9631,145,908,1641,108,904,0005,994,0002,453,504
2Mar 16, 2026 11:06138,1221,158,535,3861,126,607,0005,997,0002,449,408
3Mar 16, 2026 11:06138,8851,165,958,6921,126,857,00011,998,0002,437,120