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 listFeb 15, 2024 17:26Ryan Chung Yi ShengRyan Chung Yi ShengScore: 68,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2024 17:2368,449629,767,930568,125,23902,293,760
2Feb 15, 2024 17:2668,483632,705,647568,405,62202,289,664
3Feb 15, 2024 17:2368,487635,334,205568,438,21802,289,664
4Feb 15, 2024 17:2368,499648,379,520568,537,59702,306,048
5Feb 15, 2024 17:2668,509621,239,049568,626,98102,297,856
6Feb 15, 2024 17:2668,510637,830,843568,633,40202,297,856