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 listFeb 5, 2025 11:04E SequeiraE SequeiraScore: 75,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2025 11:0474,972646,332,610565,245,00057,024,0002,326,528
2Feb 5, 2025 11:0475,010649,074,719570,616,00051,965,0002,326,528
3Feb 5, 2025 11:0475,025650,572,855565,733,00056,973,0002,367,488