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 11, 2023 05:33Giga BowserGiga BowserScore: 62,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2023 05:3362,531580,951,899519,005,88702,281,472
2Jul 11, 2023 05:3362,630576,049,376519,830,62002,285,568
3Jul 11, 2023 05:3362,753584,018,600520,846,24102,293,760