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 12:53Dominique GarmierDominique GarmierScore: 46,480Success
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 12:5346,476401,358,048380,102,0001,000,0002,277,376
2Mar 25, 2026 12:5346,480404,825,808380,133,0001,000,0002,277,376
3Mar 25, 2026 12:5346,545402,096,091379,673,0001,998,0002,277,376