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:36Giga BowserGiga BowserScore: 60,027Success
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:3660,006558,393,294498,047,29902,277,376
2Jul 11, 2023 05:3660,027565,631,484498,225,07802,269,184
3Jul 11, 2023 05:3660,097564,117,550498,808,62102,260,992