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 17:26Josu San MartinJosu San MartinScore: 4,587Success
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 17:264,43748,086,58235,686,0001,145,0002,113,536
2May 10, 2026 17:264,45546,173,34935,838,0001,145,0002,113,536
3May 10, 2026 17:264,57449,532,18236,833,0001,138,0002,113,536
4May 10, 2026 17:264,58648,644,34136,912,0001,154,0002,113,536
5May 10, 2026 17:264,58747,591,11536,935,0001,140,0002,113,536
6May 10, 2026 17:264,58948,777,66836,947,0001,148,0002,113,536
7May 10, 2026 17:264,61546,974,52937,176,0001,133,0002,113,536
8May 10, 2026 17:264,65149,702,09137,465,0001,139,0002,113,536
9May 10, 2026 17:264,67248,110,79937,682,0001,100,0002,113,536