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 8, 2025 08:26luckyhwanluckyhwanScore: 2,025,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 08:262,024,86616,839,828,57316,741,414,00064,974,0002,277,376
2Dec 8, 2025 08:262,025,08616,844,243,14116,738,239,00069,971,0002,359,296
3Dec 8, 2025 08:262,025,30516,841,889,42216,733,061,00076,968,0002,277,376
4Dec 8, 2025 08:262,025,34616,847,415,26416,739,399,00070,972,0002,289,664
5Dec 8, 2025 08:262,025,35016,848,441,40216,741,435,00068,972,0002,519,040
6Dec 8, 2025 08:262,025,44616,842,939,87516,739,236,00071,966,0002,375,680
7Dec 8, 2025 08:262,026,04716,853,251,32016,748,219,00067,968,0002,277,376
8Dec 8, 2025 08:262,027,72616,858,784,95116,758,154,00071,970,0002,277,376
9Dec 8, 2025 08:262,038,62116,954,165,58416,855,583,00064,971,0002,289,664