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 listSep 7, 2026 15:21Kevin PetersKevin PetersScore: 62,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:2162,725530,926,253519,615,0001,004,0002,113,536
2Sep 7, 2026 15:2162,725531,021,747519,615,0001,004,0002,113,536
3Sep 7, 2026 15:2162,742530,791,565519,755,0001,004,0002,113,536
4Sep 7, 2026 15:2162,758531,637,521519,893,0001,004,0002,113,536
5Sep 7, 2026 15:2162,766530,925,918519,957,0001,005,0002,113,536
6Sep 7, 2026 15:2162,771532,197,086519,997,0001,003,0002,113,536
7Sep 7, 2026 15:2162,785531,249,441520,115,0001,005,0002,113,536
8Sep 7, 2026 15:2162,828532,308,626520,475,0001,005,0002,113,536
9Sep 7, 2026 15:2162,837532,226,067520,545,0001,005,0002,113,536