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 listSep 7, 2026 15:03Kevin PetersKevin PetersScore: 67,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:0467,201568,688,405504,504,00053,265,0002,113,536
2Sep 7, 2026 15:0467,206568,013,257504,548,00053,263,0002,113,536
3Sep 7, 2026 15:0467,225568,084,528503,749,00054,221,0002,113,536
4Sep 7, 2026 15:0467,238569,014,727504,798,00053,281,0002,113,536
5Sep 7, 2026 15:0467,246568,203,923503,790,00054,360,0002,113,536
6Sep 7, 2026 15:0467,246568,308,071504,879,00053,264,0002,113,536
7Sep 7, 2026 15:0467,281568,560,577504,179,00054,259,0002,113,536
8Sep 7, 2026 15:0467,292568,707,571504,182,00054,342,0002,113,536
9Sep 7, 2026 15:0467,296568,762,356504,328,00054,235,0002,113,536