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:05Josu San MartinJosu San MartinScore: 4,125Success
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:054,09849,781,72832,895,0001,122,0002,482,176
2May 10, 2026 05:054,09952,095,87432,879,0001,145,0002,490,368
3May 10, 2026 05:054,10351,918,42332,920,0001,139,0002,482,176
4May 10, 2026 05:054,12147,315,33433,185,0001,026,0002,486,272
5May 10, 2026 05:054,12549,189,92633,108,0001,131,0002,478,080
6May 10, 2026 05:054,12851,735,82733,213,0001,053,0002,486,272
7May 10, 2026 05:054,13052,286,17733,221,0001,059,0002,482,176
8May 10, 2026 05:054,13750,011,63433,284,0001,054,0002,490,368
9May 10, 2026 05:054,14050,676,05633,305,0001,063,0002,486,272