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 listAug 30, 2026 21:42Josu San MartinJosu San MartinScore: 4,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:424,25243,756,02434,266,0001,033,0002,113,536
2Aug 30, 2026 21:424,25743,830,34334,308,0001,028,0002,113,536
3Aug 30, 2026 21:424,26843,888,35634,373,0001,052,0002,113,536
4Aug 30, 2026 21:424,27343,952,06134,420,0001,047,0002,113,536
5Aug 30, 2026 21:424,27943,976,29034,449,0001,072,0002,113,536
6Aug 30, 2026 21:424,29844,127,16634,559,0001,121,0002,113,536
7Aug 30, 2026 21:424,30644,179,29734,613,0001,128,0002,113,536
8Aug 30, 2026 21:424,31144,259,47034,658,0001,125,0002,113,536
9Aug 30, 2026 21:424,34644,536,87035,041,0001,039,0002,113,536