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 listMar 13, 2026 12:32Eric CeglieEric CeglieScore: 28,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 12:3228,316262,096,741233,031,0001,991,0002,375,680
2Mar 13, 2026 12:3228,331266,856,856233,144,0002,001,0002,260,992
3Mar 13, 2026 12:3228,332255,532,398234,156,0001,000,0002,379,776
4Mar 13, 2026 12:3228,336258,461,766235,186,00002,387,968
5Mar 13, 2026 12:3228,337256,158,626234,198,0001,000,0002,383,872
6Mar 13, 2026 12:3228,351258,579,842234,311,0001,001,0002,519,040
7Mar 13, 2026 12:3228,377260,662,029234,524,0001,002,0002,375,680
8Mar 13, 2026 12:3228,378259,219,490235,534,00002,260,992
9Mar 13, 2026 12:3228,397260,536,826233,696,0001,997,0002,260,992