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 00:03Victor MerckléVictor MerckléScore: 4,339Success
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 00:044,28343,014,24634,438,0001,112,0002,113,536
2Jun 25, 2026 00:044,28343,083,13134,443,0001,108,0002,113,536
3Jun 25, 2026 00:044,28943,112,68734,507,0001,096,0002,113,536
4Jun 25, 2026 00:044,32043,503,99134,741,0001,120,0002,113,536
5Jun 25, 2026 00:044,33943,560,31134,882,0001,133,0002,113,536
6Jun 25, 2026 00:044,37744,128,44135,233,0001,097,0002,113,536
7Jun 25, 2026 00:044,48344,898,00936,112,0001,098,0002,113,536
8Jun 25, 2026 00:044,54545,273,50936,680,0001,045,0002,113,536
9Jun 25, 2026 00:044,55645,744,92736,709,0001,110,0002,113,536