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 11:08Josu San MartinJosu San MartinError
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 11:10049,472,82032,766,0001,127,0002,490,368expected "53681450137428413 ", got "53681449344267592 "
2May 10, 2026 11:104,02848,035,57132,334,0001,103,0002,490,368
3May 10, 2026 11:104,03647,383,42332,394,0001,111,0002,486,272
4May 10, 2026 11:104,04949,158,68132,487,0001,123,0002,486,272
5May 10, 2026 11:104,06747,929,11032,636,0001,121,0002,478,080
6May 10, 2026 11:104,07146,359,84132,745,0001,045,0002,478,080
7May 10, 2026 11:104,07247,831,80932,710,0001,093,0002,494,464
8May 10, 2026 11:104,08446,174,87332,804,0001,096,0002,486,272
9May 10, 2026 11:104,14249,832,56133,336,0001,048,0002,490,368