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 listOct 11, 2024 16:46Joad NacerJoad NacerScore: 4,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 16:464,43569,285,78934,824,0001,989,0002,351,104
2Oct 11, 2024 16:464,43559,611,17635,819,000994,0002,297,856
3Oct 11, 2024 16:464,44962,505,32735,929,000998,0002,289,664
4Oct 11, 2024 16:464,49555,791,18635,294,0002,016,0002,306,048
5Oct 11, 2024 16:464,49761,084,48435,309,0002,017,0002,301,952
6Oct 11, 2024 16:464,51657,653,62834,442,0003,039,0002,392,064