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 listOct 24, 2025 07:31Rashin SergeyRashin SergeyScore: 393,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 07:31392,6673,287,754,3633,195,175,00063,963,0002,281,472
2Oct 24, 2025 07:31393,3983,291,328,2733,186,249,00078,956,0002,289,664
3Oct 24, 2025 07:31407,1343,404,498,8813,313,247,00065,965,0002,289,664