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 26, 2026 10:41Dominique GarmierDominique GarmierScore: 12,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 10:4112,611125,550,063102,406,0001,003,0002,453,504
2Mar 26, 2026 10:4112,700130,940,037102,141,0002,002,0002,322,432
3Mar 26, 2026 10:4112,782136,526,364101,821,0002,994,0002,306,048