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:47warshipwarshipScore: 107,538Success
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:47107,270917,970,211632,532,000257,809,0002,289,664
2Dec 4, 2025 06:47107,338923,044,925650,204,000240,705,0002,293,760
3Dec 4, 2025 06:47107,369910,267,093642,398,000248,767,0002,277,376
4Dec 4, 2025 06:47107,485916,229,520648,364,000243,761,0002,428,928
5Dec 4, 2025 06:47107,538924,941,517635,691,000256,875,0002,285,568
6Dec 4, 2025 06:47107,565920,368,995639,850,000252,940,0002,285,568
7Dec 4, 2025 06:47107,568920,092,869640,149,000252,664,0002,277,376
8Dec 4, 2025 06:47107,603919,440,860642,358,000250,749,0002,285,568
9Dec 4, 2025 06:47110,211936,914,159651,821,000262,927,0002,289,664