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 listJun 10, 2026 16:33Victor MerckléVictor MerckléScore: 4,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:344,51345,149,67736,347,0001,115,0002,113,536
2Jun 10, 2026 16:344,51744,959,50236,384,0001,112,0002,113,536
3Jun 10, 2026 16:344,52145,122,45436,450,0001,079,0002,113,536
4Jun 10, 2026 16:344,52445,150,06636,458,0001,098,0002,113,536
5Jun 10, 2026 16:344,52545,508,65836,423,0001,140,0002,113,536
6Jun 10, 2026 16:344,53545,405,63336,531,0001,110,0002,113,536
7Jun 10, 2026 16:344,53945,256,78036,631,0001,046,0002,113,536
8Jun 10, 2026 16:344,53945,255,62336,662,0001,012,0002,113,536
9Jun 10, 2026 16:344,74647,014,03038,317,0001,080,0002,113,536