TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listMar 26, 2026 22:50Dominique GarmierDominique GarmierScore: 154,495Success
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 22:50153,03084,863,07656,621,00002,334,720
2Mar 26, 2026 22:43154,33286,315,80656,102,0001,001,0002,334,720
3Mar 26, 2026 22:43154,39780,892,37355,123,0002,004,0002,330,624
4Mar 26, 2026 22:43154,49583,386,65055,158,0002,005,0002,334,720
5Mar 26, 2026 22:50154,95187,457,34555,321,0002,011,0002,334,720
6Mar 26, 2026 22:50156,30581,486,26056,836,000997,0002,404,352