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 22, 2026 18:35Dominique GarmierDominique GarmierScore: 7,524,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 18:357,518,6738,908,533,084547,520,0002,234,389,000274,432
2Mar 22, 2026 18:357,524,00010,158,586,046552,564,0002,231,316,000278,528
3Mar 22, 2026 18:357,675,5659,731,334,054546,697,0002,293,262,000319,488