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 22:01izotoffizotoffScore: 124,108Success
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 22:01123,29271,710,31344,605,0001,013,0002,387,968
2Mar 16, 2026 22:01124,10873,423,18743,924,0001,996,0002,314,240
3Mar 16, 2026 22:01125,14967,930,86845,299,0001,006,0002,387,968