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 listApr 20, 2026 16:31BenBenScore: 238,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:33237,705113,620,04140,977,00046,974,0002,322,432
2Apr 20, 2026 16:33238,037110,265,92944,037,00044,037,0002,322,432
3Apr 20, 2026 16:33240,418112,673,16442,978,00045,977,0002,306,048