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 22:19Dominique GarmierDominique GarmierScore: 211,873Success
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 22:19211,8211,762,018,3501,735,930,000999,0002,490,368
2Mar 26, 2026 22:19211,8731,770,042,3261,737,360,00002,387,968
3Mar 26, 2026 22:19211,9411,764,046,4991,734,920,0002,998,0002,322,432