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 13:26Josu San MartinJosu San MartinScore: 4,646Success
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 13:284,61245,374,80837,266,0001,018,0002,113,536
2May 10, 2026 13:284,61947,837,74738,340,00002,113,536
3May 10, 2026 13:284,63145,697,88538,439,00002,113,536
4May 10, 2026 13:284,64550,814,53337,516,0001,038,0002,113,536
5May 10, 2026 13:284,64645,933,99638,568,00002,113,536
6May 10, 2026 13:284,65247,632,78037,615,0001,001,0002,113,536
7May 10, 2026 13:284,66048,559,58738,682,00002,113,536
8May 10, 2026 13:284,67147,471,51837,739,0001,031,0002,113,536
9May 10, 2026 13:284,69647,406,04838,984,00002,113,536