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 10:57Dominique GarmierDominique GarmierScore: 97,468Success
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 10:5797,05960,994,10334,915,000997,0002,359,296
2Mar 26, 2026 10:5797,46863,000,71435,062,0001,001,0002,367,488
3Mar 26, 2026 10:57112,26567,560,43740,525,0001,013,0002,289,664