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 02:37Giga BowserGiga BowserScore: 60,663Success
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 02:3760,654582,317,554503,429,20702,273,280
2Jul 11, 2023 02:3760,663573,911,811503,503,87302,269,184
3Jul 11, 2023 02:3760,685561,011,096503,686,95402,269,184