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 9, 2026 20:57Josu San MartinJosu San MartinScore: 4,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 20:574,85261,938,14339,250,0001,029,0002,519,040
2May 9, 2026 20:574,87756,280,66039,441,0001,045,0002,527,232
3May 9, 2026 20:574,93557,820,25039,937,0001,028,0002,498,560
4May 9, 2026 20:574,97057,283,56240,229,0001,030,0002,510,848
5May 9, 2026 20:574,97455,993,61540,263,0001,028,0002,502,656
6May 9, 2026 20:574,98255,464,42840,306,0001,050,0002,502,656
7May 9, 2026 20:575,06062,373,99440,919,0001,087,0002,306,048
8May 9, 2026 20:575,12158,603,95741,469,0001,041,0002,498,560
9May 9, 2026 20:575,16958,666,91141,880,0001,028,0002,510,848