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 listAug 16, 2026 07:54marko1597marko1597Score: 5,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 08:115,27453,771,24442,643,0001,135,0002,113,536
2Aug 16, 2026 08:115,35054,449,98843,246,0001,159,0002,113,536
3Aug 16, 2026 08:115,35954,570,18743,329,0001,151,0002,113,536
4Aug 16, 2026 08:115,37854,606,88243,487,0001,156,0002,113,536
5Aug 16, 2026 08:115,38654,767,66043,559,0001,147,0002,113,536
6Aug 16, 2026 08:115,40755,658,25943,746,0001,133,0002,113,536
7Aug 16, 2026 08:115,43955,930,73243,991,0001,153,0002,113,536
8Aug 16, 2026 08:115,55165,770,18245,065,0001,014,0002,113,536
9Aug 16, 2026 08:115,56756,263,02245,057,0001,157,0002,113,536