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 listSep 5, 2025 17:54ndrenndrenScore: 60,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2025 17:5460,435531,650,336500,615,000999,0002,510,848
2Sep 5, 2025 17:5460,444529,752,985498,689,0002,998,0002,502,656
3Sep 5, 2025 17:5460,541531,754,542500,491,0001,997,0002,519,040