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:10Ian MckibbenIan MckibbenScore: 63,437Success
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:1063,436553,882,277524,518,0001,998,0002,269,184
2Jan 21, 2025 17:1063,437548,572,033524,530,0001,998,0002,437,120
3Jan 21, 2025 17:1063,437548,473,378525,524,000999,0002,510,848