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 listSep 13, 2026 23:55drewbumpasdrewbumpasError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 23:55010,424,974,09110,351,589,00063,100,0002,113,536expected "53691583068676572 ", got "126068927781663196"
2Sep 13, 2026 23:55010,784,863,11210,711,411,00063,096,0002,113,536expected "53690230813303257 ", got "49513159814262233"
3Sep 13, 2026 23:55010,332,990,01310,258,759,00064,046,0002,113,536expected "53684710350688241 ", got "62175613087192049"