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 08:33Dominique GarmierDominique GarmierScore: 218,565Success
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 08:33218,546102,610,53578,866,0001,996,0002,543,616
2Mar 24, 2026 08:33218,565107,833,93979,871,000998,0002,334,720
3Mar 24, 2026 08:33218,595112,068,73677,885,0002,995,0002,334,720