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 21, 2025 10:54Mark R BestMark R BestScore: 59,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 10:5459,799527,105,374420,279,00076,050,0002,289,664
2Dec 21, 2025 10:5459,805528,248,250429,327,00067,051,0002,359,296
3Dec 21, 2025 10:5459,867518,776,159437,906,00058,987,0002,355,200
4Dec 21, 2025 10:5459,902518,491,437440,168,00057,021,0002,289,664
5Dec 21, 2025 10:5459,925525,383,135435,333,00062,047,0002,285,568
6Dec 21, 2025 10:5459,937527,491,450426,412,00071,068,0002,355,200
7Dec 21, 2025 10:5459,977523,885,983444,833,00052,980,0002,289,664
8Dec 21, 2025 10:5460,023523,261,326428,161,00070,026,0002,289,664
9Dec 21, 2025 10:5460,101536,299,555422,864,00075,975,0002,285,568