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 16, 2026 00:04Dominique GarmierDominique GarmierScore: 100,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 00:04100,58961,522,21136,213,0001,005,0002,277,376
2Mar 16, 2026 00:04100,93870,585,31036,338,0001,009,0002,396,160
3Mar 16, 2026 00:04101,21458,646,70437,449,00002,392,064