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 17, 2024 17:29Dibash ThapaDibash ThapaScore: 382,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2024 17:29380,7443,186,895,5743,098,215,00061,964,0002,281,472
2Sep 17, 2024 17:29382,2683,206,773,1013,100,876,00071,950,0002,367,488
3Sep 17, 2024 17:29384,0113,214,907,2223,127,328,00059,967,0002,367,488