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 09:58tch1001tch1001Score: 91,204Success
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 09:5891,058781,554,664754,780,000999,0002,273,280
2Feb 16, 2026 09:5891,204778,157,365755,998,000999,0002,273,280
3Feb 16, 2026 09:5891,259788,358,393755,448,0001,998,0002,400,256