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 listMay 11, 2026 07:45wnwnScore: 3,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:453,31134,655,04826,474,0001,009,0002,113,536
2May 11, 2026 07:453,31235,383,97726,450,0001,046,0002,113,536
3May 11, 2026 07:453,33235,551,35226,627,0001,030,0002,113,536
4May 11, 2026 07:453,33434,934,43626,659,0001,016,0002,113,536
5May 11, 2026 07:453,33735,524,25726,676,0001,026,0002,113,536
6May 11, 2026 07:453,34338,031,99926,718,0001,035,0002,113,536
7May 11, 2026 07:453,34436,744,47826,746,0001,011,0002,113,536
8May 11, 2026 07:453,50138,559,32328,020,0001,044,0002,113,536
9May 11, 2026 07:453,52236,822,10828,233,0001,004,0002,113,536