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 listSep 3, 2026 15:39boop34boop34Score: 10,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 15:4010,36095,796,28184,916,0001,074,0002,113,536
2Sep 3, 2026 15:4010,45996,694,83485,809,0001,004,0002,113,536
3Sep 3, 2026 15:4010,50597,017,81786,064,0001,135,0002,113,536
4Sep 3, 2026 15:4010,52197,308,37586,314,0001,016,0002,113,536
5Sep 3, 2026 15:4010,52597,228,77586,273,0001,091,0002,113,536
6Sep 3, 2026 15:4010,55297,531,69586,476,0001,113,0002,113,536
7Sep 3, 2026 15:4010,58999,072,00086,890,0001,003,0002,113,536
8Sep 3, 2026 15:4010,64298,161,18187,318,0001,012,0002,113,536
9Sep 3, 2026 15:4010,70498,657,44587,771,0001,080,0002,113,536