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 listApr 9, 2024 02:25httpsxhttpsxScore: 323,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2024 02:25323,6172,745,316,3112,686,020,48402,244,608
2Apr 9, 2024 02:25323,7902,758,637,9422,687,456,85802,244,608
3Apr 9, 2024 02:25330,2822,801,065,4142,741,344,62402,240,512