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 14:23Dominique GarmierDominique GarmierScore: 13,086Success
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 14:2313,077128,623,580105,227,0002,004,0002,449,408
2Mar 23, 2026 14:2313,086129,069,869104,299,0003,008,0002,445,312
3Mar 23, 2026 14:2313,144139,610,977106,781,000997,0002,441,216