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 9, 2024 09:53matsuoka-601matsuoka-601Score: 7,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2024 09:547,046119,435,67358,481,90002,207,744
2Feb 9, 2024 09:537,077120,404,48258,742,02102,199,552
3Feb 9, 2024 09:537,100121,672,04158,932,44402,207,744
4Feb 9, 2024 09:547,102128,352,48358,950,07602,207,744
5Feb 9, 2024 09:537,110134,047,60259,012,25202,207,744
6Feb 9, 2024 09:547,253129,165,08060,201,24202,203,648