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 25, 2026 11:45Victor MerckléVictor MerckléScore: 14,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 11:4914,302129,194,375117,598,0001,109,0002,113,536
2Jun 25, 2026 11:4914,303126,808,953117,589,0001,129,0002,113,536
3Jun 25, 2026 11:4914,316126,337,489117,682,0001,143,0002,113,536
4Jun 25, 2026 11:4914,318126,567,202117,739,0001,102,0002,113,536
5Jun 25, 2026 11:4914,319127,197,177117,735,0001,115,0002,113,536
6Jun 25, 2026 11:4914,333126,621,704117,947,0001,024,0002,113,536
7Jun 25, 2026 11:4914,338126,542,158117,925,0001,084,0002,113,536
8Jun 25, 2026 11:4914,345126,917,346117,970,0001,099,0002,113,536
9Jun 25, 2026 11:4914,528128,218,793119,581,0001,006,0002,113,536