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 27, 2025 04:37Tan Lip WeiTan Lip WeiScore: 32,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 04:3732,637292,575,529268,892,0001,999,0002,265,088
2Oct 27, 2025 04:3732,655298,518,507269,034,0002,000,0002,260,992
3Oct 27, 2025 04:3732,657293,617,161270,051,0001,000,0002,285,568
4Oct 27, 2025 04:3732,661293,977,785270,085,0001,000,0002,519,040
5Oct 27, 2025 04:3732,667299,542,387269,135,0002,001,0002,285,568
6Oct 27, 2025 04:3732,690294,741,353269,329,0002,002,0002,285,568
7Oct 27, 2025 04:3732,694292,801,935270,356,0001,001,0002,265,088
8Oct 27, 2025 04:3732,702295,874,151269,428,0001,995,0002,289,664
9Oct 27, 2025 04:3732,719297,014,387270,568,000998,0002,281,472