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 26, 2026 15:41Genos0Genos0Score: 87,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 15:4187,253747,683,746576,365,000147,837,0002,473,984
2Feb 26, 2026 15:4187,496757,550,554575,380,000150,837,0002,383,872
3Feb 26, 2026 15:4187,957756,937,881577,033,000153,008,0002,277,376