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 2, 2025 08:50matsuoka-601matsuoka-601Score: 43,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2025 08:5043,227385,556,884355,782,0002,998,0002,330,624
2Jan 2, 2025 08:5043,247380,733,918354,953,0003,999,0002,347,008
3Jan 2, 2025 08:5043,263382,302,560356,082,0003,000,0002,330,624