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 21:38Dominique GarmierDominique GarmierScore: 10,590Success
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 21:3810,539109,822,75084,410,0002,009,0002,416,640
2Mar 26, 2026 21:3810,590107,191,08483,847,0002,994,0002,351,104
3Mar 26, 2026 21:3810,606110,166,83985,971,000999,0002,334,720