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 listSep 24, 2023 12:31apuxbtapuxbtScore: 132,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 12:31132,6561,193,039,7581,101,045,29402,281,472
2Sep 24, 2023 12:31132,7891,158,869,0631,102,148,59702,277,376
3Sep 24, 2023 12:31132,8341,169,530,0511,102,526,03402,285,568