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 listJul 16, 2026 07:44wnwnScore: 3,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 07:443,51537,126,88228,145,0001,035,0002,113,536
2Jul 16, 2026 07:443,51837,166,19028,197,0001,009,0002,113,536
3Jul 16, 2026 07:443,52837,184,38228,240,0001,044,0002,113,536
4Jul 16, 2026 07:443,54737,581,79828,415,0001,031,0002,113,536
5Jul 16, 2026 07:443,54837,401,33728,425,0001,028,0002,113,536
6Jul 16, 2026 07:443,55237,437,53328,458,0001,028,0002,113,536
7Jul 16, 2026 07:443,55237,447,23228,458,0001,031,0002,113,536
8Jul 16, 2026 07:443,70938,911,36129,778,0001,007,0002,113,536
9Jul 16, 2026 07:443,71038,743,76229,750,0001,046,0002,113,536