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 17, 2025 06:25Ashish AhujaAshish AhujaScore: 15,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 06:2515,634155,277,515118,782,00010,979,0002,437,120
2Aug 17, 2025 06:2515,637154,778,360114,811,00014,975,0002,420,736
3Aug 17, 2025 06:2515,773159,556,657118,921,00011,992,0002,428,928