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 listJul 16, 2026 07:52wnwnScore: 3,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 07:523,96540,800,61531,909,0001,001,0002,113,536
2Jul 16, 2026 07:523,96941,073,32331,906,0001,037,0002,113,536
3Jul 16, 2026 07:523,97241,116,17931,946,0001,026,0002,113,536
4Jul 16, 2026 07:523,97741,200,49031,983,0001,034,0002,113,536
5Jul 16, 2026 07:523,97740,914,63331,992,0001,019,0002,113,536
6Jul 16, 2026 07:524,03041,400,22032,413,0001,036,0002,113,536
7Jul 16, 2026 07:524,05141,696,45232,590,0001,035,0002,113,536
8Jul 16, 2026 07:524,05541,772,98732,657,0001,001,0002,113,536
9Jul 16, 2026 07:524,13842,482,63133,305,0001,041,0002,113,536