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 11:42Dominique GarmierDominique GarmierScore: 12,513Success
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 11:429,642106,012,29677,061,0002,001,0002,490,368
2Mar 26, 2026 11:4212,513134,395,325102,604,00002,408,448
3Mar 26, 2026 11:4212,861127,456,204103,450,0002,008,0002,441,216