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 8, 2024 17:14Alexey TarasovAlexey TarasovScore: 394,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2024 17:14393,0873,290,916,5093,193,670,00068,949,0002,363,392
2Nov 8, 2024 17:14393,1233,292,352,8003,188,970,00073,952,0002,367,488
3Nov 8, 2024 17:14393,6703,296,730,8663,188,495,00078,962,0002,285,568
4Nov 8, 2024 17:14393,7863,293,314,5073,205,456,00062,969,0002,293,760
5Nov 8, 2024 17:14394,1263,299,036,3773,208,283,00062,966,0002,371,584
6Nov 8, 2024 17:14395,0813,309,840,4043,208,214,00070,960,0002,285,568
7Nov 8, 2024 17:14395,8083,313,340,6473,222,245,00062,965,0002,289,664
8Nov 8, 2024 17:14397,3833,327,797,6453,237,312,00060,968,0002,285,568
9Nov 8, 2024 17:14399,7383,349,202,1843,256,846,00060,978,0002,285,568