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 listDec 24, 2024 11:32Sean DewarSean DewarScore: 74,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 11:3274,407647,103,358616,580,000999,0002,273,280
2Dec 24, 2024 11:3274,477642,026,756617,156,0001,000,0002,289,664
3Dec 24, 2024 11:3274,489649,543,486618,259,00002,289,664
4Dec 24, 2024 11:3274,493643,221,024617,292,0001,000,0002,289,664
5Dec 24, 2024 11:3274,532643,353,156616,615,0001,998,0002,273,280
6Dec 24, 2024 11:3274,755645,950,837618,468,0001,998,0002,281,472