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 27, 2026 13:32Genos0Genos0Score: 78,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 13:3278,466677,436,631543,389,000107,878,0002,347,008
2Feb 27, 2026 13:3278,467682,288,956544,397,000106,881,0002,469,888
3Feb 27, 2026 13:3278,546683,002,694544,941,000106,988,0002,281,472