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 listDec 17, 2023 04:37matsuoka-601matsuoka-601Score: 6,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2023 04:376,903127,310,46757,290,88102,281,472
2Dec 29, 2023 14:536,920122,742,93457,436,44002,289,664
3Dec 17, 2023 04:376,923118,272,34957,461,39802,273,280
4Dec 29, 2023 14:536,929118,887,22257,508,09902,285,568
5Dec 29, 2023 14:536,934133,602,28257,556,17902,273,280
6Dec 17, 2023 04:377,024115,681,97358,296,06302,281,472