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 1, 2025 20:05matsuoka-601matsuoka-601Score: 89,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2025 20:0589,392766,490,176740,952,000999,0002,293,760
2Jan 1, 2025 20:0589,476771,887,344739,650,0002,998,0002,293,760
3Jan 1, 2025 20:0589,482766,999,407739,701,0002,998,0002,326,528