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 4, 2025 06:57warshipwarshipScore: 106,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 06:57106,047903,522,722626,427,000253,767,0002,449,408
2Dec 4, 2025 06:57106,066903,912,372619,541,000260,806,0002,498,560
3Dec 4, 2025 06:57106,097903,117,981630,719,000249,889,0002,334,720
4Dec 4, 2025 06:57106,135911,079,483630,230,000250,694,0002,285,568
5Dec 4, 2025 06:57106,163903,144,378619,404,000261,748,0002,289,664
6Dec 4, 2025 06:57106,205905,445,643628,642,000252,856,0002,383,872
7Dec 4, 2025 06:57106,221909,049,932621,740,000259,891,0002,285,568
8Dec 4, 2025 06:57106,337905,730,822633,710,000248,886,0002,412,544
9Dec 4, 2025 06:57106,391911,674,190623,324,000259,718,0002,289,664