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 listFeb 17, 2026 18:49wnwnScore: 7,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 18:496,96489,278,92955,810,0001,993,0002,457,600
2Feb 17, 2026 18:496,99182,445,77355,022,0003,001,0002,494,464
3Feb 17, 2026 18:497,12182,838,67556,102,0003,005,0002,519,040
4Feb 17, 2026 18:497,95689,213,58563,031,0003,001,0002,428,928
5Feb 17, 2026 18:497,99194,217,08262,304,0004,019,0002,449,408
6Feb 17, 2026 18:498,21194,419,35963,141,0005,011,0002,404,352