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 15:22matsuoka-601matsuoka-601Score: 41,561Success
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 15:2241,510375,006,469342,526,0002,003,0002,318,336
2Jan 1, 2025 15:2241,561373,660,243342,954,0001,999,0002,297,856
3Jan 1, 2025 15:2241,561371,182,504342,952,0002,005,0002,306,048