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 15, 2026 21:33flavio87flavio87Score: 6,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 21:346,04757,530,07049,158,0001,038,0002,113,536
2May 15, 2026 21:346,05857,587,86549,271,0001,017,0002,113,536
3May 15, 2026 21:346,05858,698,09149,269,0001,018,0002,113,536
4May 15, 2026 21:346,09060,075,39249,525,0001,024,0002,113,536
5May 15, 2026 21:346,12460,811,48649,816,0001,018,0002,113,536
6May 15, 2026 21:346,12861,031,99249,844,0001,020,0002,113,536
7May 15, 2026 21:346,20660,110,51150,494,0001,017,0002,113,536
8May 15, 2026 21:346,27961,682,63551,103,0001,018,0002,113,536
9May 15, 2026 21:346,34062,342,84951,588,0001,037,0002,113,536