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 listJul 22, 2024 11:370xUBN0xUBNScore: 382,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2024 11:37381,8563,236,609,4483,169,403,94902,199,552
2Jul 22, 2024 11:37382,8533,259,365,6413,177,677,50802,260,992
3Jul 22, 2024 11:37384,1283,250,443,4383,188,261,34302,199,552