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 30, 2026 10:46Dominique GarmierDominique GarmierScore: 12,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 10:4612,448130,054,167101,072,0001,000,0002,392,064
2Mar 30, 2026 10:4612,451127,916,723100,096,0002,001,0002,408,448
3Mar 30, 2026 10:4612,511129,790,910101,585,0001,005,0002,383,872