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 listJul 3, 2026 22:41Josu San MartinJosu San MartinScore: 9,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 22:429,24486,183,01573,103,0003,628,0002,113,536
2Jul 3, 2026 22:429,30786,582,58073,580,0003,670,0002,113,536
3Jul 3, 2026 22:429,32386,777,25073,827,0003,560,0002,113,536
4Jul 3, 2026 22:429,38388,655,42474,167,0003,718,0002,113,536
5Jul 3, 2026 22:429,49388,253,05775,192,0003,600,0002,113,536
6Jul 3, 2026 22:429,51688,361,21375,303,0003,688,0002,113,536
7Jul 3, 2026 22:429,51788,372,71175,209,0003,785,0002,113,536
8Jul 3, 2026 22:429,70689,910,39076,864,0003,703,0002,113,536
9Jul 3, 2026 22:429,90691,574,52478,585,0003,640,0002,113,536