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 listJan 5, 2024 12:45Oleg KovalovOleg KovalovScore: 96,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2024 12:4596,787865,656,655803,334,59002,252,800
2Jan 5, 2024 12:4596,828880,766,887803,670,86802,269,184
3Jan 5, 2024 12:4597,045879,071,993805,470,22002,260,992