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 21, 2025 17:15Ian MckibbenIan MckibbenScore: 47,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 17:1547,033423,605,666388,378,0001,996,0002,433,024
2Jan 21, 2025 17:1547,062415,507,506389,615,000999,0002,433,024
3Jan 21, 2025 17:1547,469417,533,554392,995,000999,0002,437,120