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 24, 2026 11:47Dominique GarmierDominique GarmierScore: 70,592Success
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 11:4770,44651,051,00724,060,0002,005,0002,519,040
2Mar 24, 2026 11:4770,59255,352,97325,115,0001,004,0002,281,472
3Mar 24, 2026 11:4770,96852,160,55425,249,0001,009,0002,281,472