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 listApr 13, 2026 19:20Yuriy LyfenkoYuriy LyfenkoScore: 4,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 19:194,57565,459,81835,977,0001,998,0002,310,144
2Apr 13, 2026 19:194,58266,420,87036,028,0002,001,0002,273,280
3Apr 13, 2026 19:204,58759,667,88636,067,0002,003,0002,535,424
4Apr 13, 2026 19:204,60761,888,17036,229,0002,012,0002,310,144
5Apr 13, 2026 19:194,61258,666,86636,265,0002,014,0002,535,424
6Apr 13, 2026 19:204,61457,118,02436,280,0002,015,0002,531,328