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 10, 2024 12:43Joad NacerJoad NacerScore: 8,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 12:437,31086,296,42360,674,00002,506,752
2Oct 10, 2024 12:437,32888,946,80360,821,00002,428,928
3Oct 10, 2024 12:437,33884,038,78858,906,0001,996,0002,424,832
4Oct 10, 2024 12:438,18488,911,90166,927,000998,0002,531,328
5Oct 10, 2024 12:438,19090,510,93966,978,000999,0002,424,832
6Oct 10, 2024 12:438,22192,971,39568,235,00002,424,832