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 03:19Josu San MartinJosu San MartinScore: 4,630Success
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 03:194,60454,545,98037,081,0001,140,0002,486,272
2May 10, 2026 03:194,62156,037,20637,319,0001,043,0002,490,368
3May 10, 2026 03:194,62555,494,40237,358,0001,032,0002,486,272
4May 10, 2026 03:194,62755,459,38237,317,0001,090,0002,478,080
5May 10, 2026 03:194,63057,649,97037,373,0001,063,0002,482,176
6May 10, 2026 03:194,63055,707,06137,386,0001,047,0002,490,368
7May 10, 2026 03:194,63056,340,46237,375,0001,054,0002,478,080
8May 10, 2026 03:194,63555,694,93437,339,0001,137,0002,478,080
9May 10, 2026 03:194,64955,294,88637,561,0001,030,0002,482,176