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 18:36Josu San MartinJosu San MartinScore: 5,852Success
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 18:365,79365,526,35746,883,0001,207,0002,347,008
2May 9, 2026 18:365,80166,265,09346,943,0001,208,0002,359,296
3May 9, 2026 18:365,82866,304,34747,339,0001,034,0002,342,912
4May 9, 2026 18:365,83466,606,31647,397,0001,030,0002,359,296
5May 9, 2026 18:365,85267,858,58747,366,0001,208,0002,347,008
6May 9, 2026 18:365,85465,458,30747,383,0001,211,0002,351,104
7May 9, 2026 18:365,86763,789,28047,486,0001,216,0002,351,104
8May 9, 2026 18:365,88067,236,79147,580,0001,227,0002,351,104
9May 9, 2026 18:365,89965,291,21347,934,0001,030,0002,351,104