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 10, 2026 18:55zielajzielajScore: 3,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:553,27435,742,99927,181,00002,113,536
2May 10, 2026 18:553,29035,262,16226,297,0001,013,0002,113,536
3May 10, 2026 18:553,29235,259,64526,323,0001,008,0002,113,536
4May 10, 2026 18:553,29536,603,85126,324,0001,031,0002,113,536
5May 10, 2026 18:553,29635,032,83026,356,0001,004,0002,113,536
6May 10, 2026 18:553,30037,519,01026,354,0001,036,0002,113,536
7May 10, 2026 18:553,30034,589,67926,388,0001,007,0002,113,536
8May 10, 2026 18:553,30434,683,29226,414,0001,016,0002,113,536
9May 10, 2026 18:553,50436,444,76528,070,0001,021,0002,113,536