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 listMar 22, 2025 20:27Matthew DowneyMatthew DowneyScore: 173,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2025 20:27173,0351,468,759,9641,435,195,000999,0002,281,472
2Mar 22, 2025 20:27173,1161,468,117,3491,434,861,0001,998,0002,281,472
3Mar 22, 2025 20:27174,7541,473,019,0981,449,461,000999,0002,482,176