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 24, 2026 15:07Dominique GarmierDominique GarmierScore: 19,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 15:0712,347125,110,35697,235,0004,009,0002,392,064
2Mar 24, 2026 15:0719,671183,984,173159,298,0002,003,0002,408,448
3Mar 24, 2026 15:0719,721184,300,911157,719,0003,992,0002,523,136