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 listAug 30, 2026 19:03Josu San MartinJosu San MartinScore: 5,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:035,00449,980,13940,490,0001,051,0002,113,536
2Aug 30, 2026 19:035,00450,020,10540,506,0001,035,0002,113,536
3Aug 30, 2026 19:035,01450,048,47040,592,0001,030,0002,113,536
4Aug 30, 2026 19:035,01750,093,49940,547,0001,099,0002,113,536
5Aug 30, 2026 19:035,02150,197,81840,547,0001,128,0002,113,536
6Aug 30, 2026 19:035,02350,149,38940,576,0001,123,0002,113,536
7Aug 30, 2026 19:035,02350,206,67340,672,0001,026,0002,113,536
8Aug 30, 2026 19:035,03450,374,84840,660,0001,128,0002,113,536
9Aug 30, 2026 19:035,05250,488,28640,842,0001,095,0002,113,536