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 23:36Dominique GarmierDominique GarmierScore: 320,486Success
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 23:36155,2071,296,954,3211,272,700,00002,527,232
2Mar 29, 2026 23:36320,4862,655,967,6632,626,988,000999,0002,281,472
3Mar 29, 2026 23:36325,6872,702,047,5592,669,632,000999,0002,379,776