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 31, 2026 16:38Sergey KintselSergey KintselScore: 404,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2026 16:38403,4713,358,003,9873,285,769,00063,043,0002,121,728
2May 31, 2026 16:38404,6253,367,618,0933,294,195,00064,195,0002,117,632
3May 31, 2026 16:38405,2423,372,800,6793,300,467,00063,049,0002,121,728