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 1, 2025 13:17Emanuele BolognesiEmanuele BolognesiScore: 68,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2025 13:1768,468591,217,270567,284,0001,000,0002,285,568
2May 1, 2025 13:1768,476594,329,439568,347,00002,285,568
3May 1, 2025 13:1768,510595,918,051567,637,000999,0002,285,568