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 7, 2023 00:13Giga BowserGiga BowserScore: 1,015,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2023 00:131,003,2038,387,561,4758,326,585,35402,256,896
2Jul 7, 2023 00:131,015,7368,501,732,9958,430,609,19202,260,992
3Jul 7, 2023 00:131,018,7628,516,592,4568,455,724,24402,252,800