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 25, 2026 14:08Dominique GarmierDominique GarmierScore: 36,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 14:0836,433321,821,445295,754,0002,997,0002,416,640
2Mar 25, 2026 14:0836,482323,592,507297,153,0002,001,0002,334,720
3Mar 25, 2026 14:0837,002332,906,704302,419,0001,001,0002,281,472