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 30, 2026 14:22Dominique GarmierDominique GarmierScore: 72,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 14:2272,01456,753,96126,645,00002,289,664
2Mar 30, 2026 14:2272,55950,075,99426,847,00002,338,816
3Mar 30, 2026 14:2272,76858,743,77824,930,0001,994,0002,289,664