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 24, 2026 13:25Dominique GarmierDominique GarmierScore: 10,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 13:2510,308111,101,11284,524,00002,347,008
2Mar 24, 2026 13:2510,309113,362,37783,525,0001,006,0002,363,392
3Mar 24, 2026 13:2510,311116,689,39884,548,00002,351,104