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 20:26Dominique GarmierDominique GarmierScore: 13,630Success
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 20:2613,623134,917,882108,713,0002,992,0002,416,640
2Mar 25, 2026 20:2613,630142,596,126110,770,000997,0002,457,600
3Mar 25, 2026 20:2613,640139,173,678109,850,0001,997,0002,478,080