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 8, 2026 22:34zielajzielajScore: 3,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 22:343,46345,768,30427,567,0001,177,0002,424,832
2May 8, 2026 22:343,49746,351,80327,932,0001,096,0002,428,928
3May 8, 2026 22:343,51046,124,55528,003,0001,134,0002,416,640
4May 8, 2026 22:343,57745,303,48128,543,0001,147,0002,424,832
5May 8, 2026 22:343,60046,618,90428,754,0001,131,0002,428,928
6May 8, 2026 22:343,60346,378,31328,794,0001,119,0002,424,832
7May 8, 2026 22:343,63145,083,22429,025,0001,114,0002,416,640
8May 8, 2026 22:343,65047,353,79429,214,0001,087,0002,420,736
9May 8, 2026 22:343,65944,342,38629,247,0001,129,0002,424,832