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 listNov 9, 2024 12:58Alexander KosachevAlexander KosachevScore: 264,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2024 12:58263,8472,218,533,5182,087,976,000101,950,0002,326,528
2Nov 9, 2024 12:58263,8532,220,155,3612,102,023,00087,959,0002,498,560
3Nov 9, 2024 12:58263,9762,216,372,4952,108,040,00082,962,0002,326,528
4Nov 9, 2024 12:58264,0232,217,668,7022,097,420,00093,974,0002,494,464
5Nov 9, 2024 12:58264,0482,222,519,4262,091,662,00099,936,0002,326,528
6Nov 9, 2024 12:58264,0912,217,059,8522,098,004,00093,955,0002,351,104
7Nov 9, 2024 12:58264,1162,217,200,4392,087,206,000104,960,0002,326,528
8Nov 9, 2024 12:58264,1782,219,107,4322,099,735,00092,944,0002,326,528
9Nov 9, 2024 12:58264,3302,225,650,5302,104,982,00088,956,0002,326,528