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 listJun 12, 2026 15:33Victor MerckléVictor MerckléScore: 5,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 15:345,38352,294,01543,622,0001,059,0002,113,536
2Jun 12, 2026 15:345,38352,272,30243,612,0001,074,0002,113,536
3Jun 12, 2026 15:345,38752,389,45143,646,0001,069,0002,113,536
4Jun 12, 2026 15:345,39352,337,19143,707,0001,059,0002,113,536
5Jun 12, 2026 15:345,40652,459,48743,847,0001,023,0002,113,536
6Jun 12, 2026 15:345,41052,571,33843,905,0001,005,0002,113,536
7Jun 12, 2026 15:345,41452,554,63343,919,0001,023,0002,113,536
8Jun 12, 2026 15:345,42352,648,45643,988,0001,024,0002,113,536
9Jun 12, 2026 15:345,51153,387,66944,690,0001,059,0002,113,536