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 6, 2023 23:53Giga BowserGiga BowserScore: 1,641,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2023 23:531,641,13713,682,367,42513,621,437,86602,252,800
2Jul 6, 2023 23:531,641,78513,688,950,30313,626,816,52502,256,896
3Jul 6, 2023 23:531,642,17913,688,172,14513,630,082,55902,260,992