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 listJul 19, 2022 09:17spire-ffostonspire-ffostonScore: 375,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2022 09:17375,5063,181,602,7233,116,701,34902,256,896
2Jul 19, 2022 09:17375,8333,181,016,2933,119,417,32802,191,360
3Jul 19, 2022 09:17377,1593,191,378,1163,130,416,06202,195,456