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 20, 2022 17:05gpuvgpuvScore: 102,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2022 17:04101,983917,240,619846,461,75202,256,896
2May 20, 2022 17:04102,018921,603,674846,748,60302,260,992
3May 20, 2022 17:05102,075903,375,774847,224,44102,252,800
4May 20, 2022 17:05102,146901,888,622847,813,08202,269,184
5May 20, 2022 17:04102,243910,996,168848,619,65102,256,896
6May 20, 2022 17:05102,414905,848,460850,036,41702,265,088