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 8, 2026 19:47Victor MerckléVictor MerckléScore: 28,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 19:4728,404243,274,352234,499,0001,255,0002,113,536
2Jun 8, 2026 19:4728,481244,571,935235,150,0001,243,0002,113,536
3Jun 8, 2026 19:4728,546244,556,108235,712,0001,225,0002,113,536
4Jun 8, 2026 19:4728,615245,088,172236,232,0001,278,0002,113,536
5Jun 8, 2026 19:4728,654245,441,329236,586,0001,243,0002,113,536
6Jun 8, 2026 19:4728,659245,489,567236,628,0001,248,0002,113,536
7Jun 8, 2026 19:4728,662245,503,761236,644,0001,253,0002,113,536
8Jun 8, 2026 19:4728,798246,560,995237,749,0001,279,0002,113,536
9Jun 8, 2026 19:4728,803246,640,729237,834,0001,234,0002,113,536