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 16, 2026 19:11wnwnScore: 8,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 19:128,69495,560,70469,152,0003,006,0002,285,568
2Feb 16, 2026 19:128,78395,834,75368,908,0003,994,0002,424,832
3Feb 16, 2026 19:128,80496,555,87669,069,0004,004,0002,433,024