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 12, 2026 15:17Victor MerckléVictor MerckléScore: 7,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 15:187,49469,882,89560,980,0001,224,0002,113,536
2Jun 12, 2026 15:187,51469,987,37161,131,0001,241,0002,113,536
3Jun 12, 2026 15:187,53070,149,09661,468,0001,034,0002,113,536
4Jun 12, 2026 15:187,68971,506,99262,585,0001,234,0002,113,536
5Jun 12, 2026 15:187,70371,641,68962,890,0001,053,0002,113,536
6Jun 12, 2026 15:187,71971,695,34563,030,0001,038,0002,113,536
7Jun 12, 2026 15:187,74871,983,32163,268,0001,046,0002,113,536
8Jun 12, 2026 15:187,75071,974,71863,291,0001,041,0002,113,536
9Jun 12, 2026 15:187,77672,193,88863,503,0001,044,0002,113,536