Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 25, 2025 23:26BenBenScore: 59,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 23:2659,727527,024,391493,732,0001,998,0002,379,776
2Aug 25, 2025 23:2659,738529,660,394493,826,0001,999,0002,379,776
3Aug 25, 2025 23:2659,762518,723,651495,024,0001,000,0002,519,040