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 3, 2025 07:09Zhiyang LuZhiyang LuScore: 404,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 07:19400,3363,349,389,0153,248,818,00073,973,0002,281,472
2Feb 3, 2025 07:19400,8183,358,242,8263,251,840,00074,950,0002,293,760
3Feb 3, 2025 07:19401,2283,354,892,3343,251,237,00078,957,0002,281,472
4Feb 3, 2025 07:09404,9923,384,655,2833,288,466,00072,965,0002,510,848
5Feb 3, 2025 07:09411,2413,438,503,4623,338,335,00074,962,0002,293,760
6Feb 3, 2025 07:09435,6173,643,564,9093,544,670,00070,953,0002,281,472