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 listNov 27, 2022 18:23apuxbtapuxbtScore: 350,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 18:23345,0492,921,724,0082,863,910,63402,314,240
2Nov 27, 2022 18:23350,6102,984,819,4002,910,060,46802,199,552
3Nov 27, 2022 18:23354,9983,007,655,6952,946,485,30402,260,992