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 10, 2025 07:23Emanuele BolognesiEmanuele BolognesiScore: 65,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2025 07:2365,531568,701,652541,910,0001,999,0002,285,568
2May 10, 2025 07:2365,533566,881,431541,928,0001,999,0002,285,568
3May 10, 2025 07:2365,555572,386,392543,106,0001,000,0002,355,200