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 04:55Dominique GarmierDominique GarmierScore: 675,897Success
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 04:55667,568278,182,497245,000,0002,000,0002,277,376
2Mar 24, 2026 04:55675,897274,779,598249,082,0001,000,0002,363,392
3Mar 24, 2026 04:55681,568277,082,056250,179,0002,001,0002,277,376