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 listMay 20, 2026 09:57M-RochatM-RochatScore: 11,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 09:5711,927110,588,59996,762,0002,233,0002,113,536
2May 20, 2026 09:5711,935110,952,65997,030,0002,032,0002,113,536
3May 20, 2026 09:5711,944111,111,08497,110,0002,032,0002,113,536
4May 20, 2026 09:5711,952111,020,87497,170,0002,036,0002,113,536
5May 20, 2026 09:5711,954110,407,64597,186,0002,035,0002,113,536
6May 20, 2026 09:5711,958108,824,22397,007,0002,245,0002,113,536
7May 20, 2026 09:5711,959108,736,14297,007,0002,260,0002,113,536
8May 20, 2026 09:5711,982111,646,66297,424,0002,032,0002,113,536
9May 20, 2026 09:5711,996109,349,48397,304,0002,267,0002,113,536