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 listApr 27, 2025 14:29Kevin HeaveyKevin HeaveyScore: 53,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2025 14:2953,970470,400,606446,955,000999,0002,461,696
2Apr 27, 2025 14:2953,983470,337,598447,061,0001,000,0002,363,392
3Apr 27, 2025 14:2954,030475,010,961447,449,0001,001,0002,367,488