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 listApr 25, 2026 04:53limanjun99limanjun99Score: 41,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 04:5439,491343,297,239317,837,0005,996,0002,310,144
2Apr 25, 2026 04:5441,196359,018,591334,815,0002,998,0002,478,080
3Apr 25, 2026 04:5441,285357,729,442335,546,0002,995,0002,318,336