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 29, 2026 18:44Dominique GarmierDominique GarmierScore: 172,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 18:44171,0221,429,550,2471,400,382,0001,999,0002,277,376
2Mar 29, 2026 22:17171,3381,434,397,5671,404,974,00002,420,736
3Mar 29, 2026 22:17171,7011,437,225,8451,404,950,0002,997,0002,449,408
4Mar 29, 2026 18:44172,1591,432,310,9461,410,705,000999,0002,531,328
5Mar 29, 2026 22:17172,3201,438,633,8231,412,024,0001,000,0002,494,464
6Mar 29, 2026 18:44172,3501,438,104,9981,411,269,0001,998,0002,293,760