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 14, 2026 13:21Kevin HeaveyKevin HeaveyScore: 3,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 13:233,53137,968,81528,100,0001,213,0002,113,536
2Sep 14, 2026 13:233,53437,997,08628,304,0001,032,0002,113,536
3Sep 14, 2026 13:233,54038,199,86028,165,0001,224,0002,113,536
4Sep 14, 2026 13:233,58838,456,87628,733,0001,048,0002,113,536
5Sep 14, 2026 13:233,66346,571,06429,344,0001,065,0002,113,536
6Sep 14, 2026 13:233,76939,993,84330,055,0001,234,0002,113,536
7Sep 14, 2026 13:233,78540,187,06030,200,0001,221,0002,113,536
8Sep 14, 2026 13:233,83741,338,42830,637,0001,217,0002,113,536
9Sep 14, 2026 13:233,83941,294,49730,683,0001,184,0002,113,536