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:05Eric CeglieEric CeglieScore: 37,173Success
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:0537,128330,498,118306,163,0002,001,0002,383,872
2Mar 13, 2026 12:0537,155329,973,145307,385,0001,001,0002,519,040
3Mar 13, 2026 12:0537,160335,308,177307,429,0001,001,0002,260,992
4Mar 13, 2026 12:0537,168334,036,146308,497,00002,523,136
5Mar 13, 2026 12:0537,173332,256,574307,539,000998,0002,383,872
6Mar 13, 2026 12:0537,181335,112,676305,607,0002,996,0002,514,944
7Mar 13, 2026 12:0537,194335,029,773306,709,0001,998,0002,519,040
8Mar 13, 2026 12:0537,269341,123,876309,330,00002,383,872
9Mar 13, 2026 12:0537,499335,707,135310,243,0001,000,0002,256,896