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 listMay 26, 2024 10:05Ivan BessonovIvan BessonovScore: 32,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2024 10:0532,462328,108,106269,438,05302,285,568
2May 26, 2024 10:0532,476328,482,077269,554,53402,297,856
3May 26, 2024 10:0532,481334,306,407269,591,32702,289,664