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 7, 2021 10:54Yuriy B.Yuriy B.Score: 364,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2021 10:54363,8703,084,504,9133,020,120,17402,293,760
2Sep 7, 2021 10:54364,0573,105,109,4243,021,669,71202,224,128
3Sep 7, 2021 10:54364,3803,082,629,4293,024,351,29202,244,608
4Sep 7, 2021 10:54364,4253,089,216,1233,024,729,87602,256,896
5Sep 7, 2021 10:54364,8343,086,256,6463,028,120,76002,273,280
6Sep 7, 2021 10:54364,8813,084,834,8653,028,514,45202,199,552