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 9, 2025 17:08pseppsepScore: 183,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 17:08183,6991,549,146,3921,456,712,00067,986,0002,277,376
2Dec 9, 2025 17:08183,7081,548,673,6841,471,784,00052,992,0002,265,088
3Dec 9, 2025 17:08183,7101,546,826,8921,443,805,00080,989,0002,277,376
4Dec 9, 2025 17:08183,8001,548,627,2881,437,569,00087,973,0002,285,568
5Dec 9, 2025 17:08183,8121,548,959,8021,480,650,00044,989,0002,260,992
6Dec 9, 2025 17:08183,8161,553,441,6671,462,686,00062,986,0002,519,040
7Dec 9, 2025 17:08184,3681,553,700,2881,464,288,00065,967,0002,277,376
8Dec 9, 2025 17:08193,1201,627,201,2631,532,899,00069,995,0002,265,088
9Dec 9, 2025 17:08193,1351,629,110,8221,512,074,00090,944,0002,285,568