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 listMar 24, 2026 04:45servant714servant714Score: 64,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 04:4564,681558,302,341479,867,00056,984,0002,273,280
2Mar 24, 2026 04:4564,753566,732,753483,404,00054,045,0002,281,472
3Mar 24, 2026 04:4564,777565,749,789479,691,00057,962,0002,281,472
4Mar 24, 2026 04:4564,834564,422,003484,108,00054,012,0002,273,280
5Mar 24, 2026 04:4564,848557,287,820483,218,00055,024,0002,428,928
6Mar 24, 2026 04:4564,872567,403,969475,385,00063,051,0002,437,120
7Mar 24, 2026 04:4564,899563,131,301478,701,00059,962,0002,269,184
8Mar 24, 2026 04:4564,927563,190,179480,908,00057,988,0002,424,832
9Mar 24, 2026 04:4564,936568,601,122478,970,00059,996,0002,269,184