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 listNov 5, 2025 14:04dhathorndhathornScore: 273,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 14:04273,2282,294,647,1722,163,852,000103,944,0002,326,528
2Nov 5, 2025 14:04273,2832,298,582,4302,171,282,00096,967,0002,326,528
3Nov 5, 2025 14:04273,3252,301,378,8232,159,667,000108,932,0002,326,528
4Nov 5, 2025 14:04273,3332,293,450,4322,168,720,00099,941,0002,326,528
5Nov 5, 2025 14:04273,3382,301,827,4222,170,762,00097,944,0002,433,024
6Nov 5, 2025 14:04273,3502,307,820,5792,172,855,00095,949,0002,326,528
7Nov 5, 2025 14:04273,4242,295,959,7182,182,479,00086,939,0002,326,528
8Nov 5, 2025 14:04273,4632,294,404,9782,163,802,000105,941,0002,420,736
9Nov 5, 2025 14:04273,5932,301,374,6012,170,873,00099,948,0002,424,832