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 26, 2026 02:02sophiasophiaScore: 60,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 02:0260,143524,334,074498,190,0001,000,0002,392,064
2Feb 26, 2026 02:0260,156523,961,681498,292,0001,000,0002,523,136
3Feb 26, 2026 02:0260,195528,063,363497,620,0001,998,0002,523,136
4Feb 26, 2026 02:0260,209523,292,297497,735,0001,998,0002,531,328
5Feb 26, 2026 02:0260,218531,533,058498,809,000999,0002,514,944
6Feb 26, 2026 02:0260,223525,044,107495,852,0003,998,0002,514,944
7Feb 26, 2026 02:0260,233525,991,918497,938,0001,999,0002,392,064
8Feb 26, 2026 02:0260,273525,816,201500,270,00002,523,136
9Feb 26, 2026 02:0260,302532,704,019498,512,0001,998,0002,514,944