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 21, 2022 07:56Liam PowellLiam PowellScore: 324,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2022 07:56323,6362,749,066,9292,686,179,69002,379,776
2Jul 21, 2022 07:56324,3382,767,992,5952,692,005,40202,502,656
3Jul 21, 2022 07:56324,4782,763,566,6032,693,163,73202,371,584