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 21, 2026 12:34Dominique GarmierDominique GarmierScore: 13,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 12:3413,192134,730,143106,169,0002,003,0002,297,856
2Mar 21, 2026 12:3413,229129,196,265108,480,00002,314,240
3Mar 21, 2026 12:3413,243133,765,832107,586,0001,005,0002,334,720