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 19, 2025 18:43Josu San MartinJosu San MartinScore: 43,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 18:4343,412383,956,377359,318,0001,000,0002,351,104
2Dec 19, 2025 18:4343,430389,985,227360,470,00002,285,568
3Dec 19, 2025 18:4343,437389,922,768358,533,0001,997,0002,285,568
4Dec 19, 2025 18:4343,450385,669,569358,634,0001,997,0002,473,984
5Dec 19, 2025 18:4343,451386,286,810359,642,000999,0002,285,568
6Dec 19, 2025 18:4343,455389,016,146358,678,0001,998,0002,359,296
7Dec 19, 2025 18:4343,455390,287,492360,678,00002,285,568
8Dec 19, 2025 18:4343,458386,458,774359,702,000999,0002,285,568
9Dec 19, 2025 18:4343,459385,148,392358,715,0001,998,0002,285,568