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 listMay 10, 2026 05:41Josu San MartinJosu San MartinScore: 4,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 05:424,42155,538,19135,679,0001,023,0002,486,272
2May 10, 2026 05:424,44154,233,57035,797,0001,068,0002,486,272
3May 10, 2026 05:424,44453,180,14635,851,0001,042,0002,482,176
4May 10, 2026 05:424,44554,080,90735,759,0001,137,0002,486,272
5May 10, 2026 05:424,44553,011,64635,758,0001,143,0002,486,272
6May 10, 2026 05:424,44751,418,86435,793,0001,124,0002,482,176
7May 10, 2026 05:424,46652,976,42035,898,0001,171,0002,490,368
8May 10, 2026 05:424,47451,532,81636,091,0001,046,0002,478,080
9May 10, 2026 05:424,50556,106,26836,343,0001,055,0002,490,368