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 21, 2026 20:38Dominique GarmierDominique GarmierScore: 13,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:3813,160135,902,011104,918,0002,997,0002,400,256
2Mar 21, 2026 20:3813,316134,426,325105,290,0003,899,0002,486,272
3Mar 21, 2026 20:3813,388131,927,114107,788,0001,996,0002,306,048