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 27, 2024 21:42Joad NacerJoad NacerScore: 4,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2024 21:424,56060,409,62136,852,000996,0002,306,048
2Dec 27, 2024 21:424,57263,490,04234,952,0002,995,0002,535,424
3Dec 27, 2024 21:424,58659,631,21537,063,0001,001,0002,535,424
4Dec 27, 2024 21:424,62458,441,32635,352,0003,030,0002,379,776
5Dec 27, 2024 21:424,65063,467,66238,596,00002,531,328
6Dec 27, 2024 21:424,97365,390,27539,266,0002,013,0002,531,328