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 listFeb 17, 2026 22:40lipapipalipapipaScore: 6,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 22:406,58379,782,61252,618,0002,023,0002,490,368
2Feb 17, 2026 22:406,61083,768,58251,869,0002,992,0002,494,464
3Feb 17, 2026 22:406,63376,633,20052,050,0003,002,0002,318,336
4Feb 17, 2026 22:406,67778,477,01353,403,0002,015,0002,330,624
5Feb 17, 2026 22:406,68280,068,70853,444,0002,016,0002,314,240
6Feb 17, 2026 22:406,82784,754,99255,650,0001,011,0002,486,272