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 28, 2026 03:42Dominique GarmierDominique GarmierScore: 22,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 03:4212,704126,737,656102,171,0002,003,0002,383,872
2Mar 28, 2026 03:4222,537211,230,667181,804,0002,996,0002,408,448
3Mar 28, 2026 03:4223,094213,831,449187,366,0002,003,0002,289,664