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 17, 2026 12:16timothygktimothygkScore: 43,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 12:1743,260369,891,431357,953,0001,106,0002,113,536
2Oct 17, 2026 12:1743,272369,952,764358,016,0001,146,0002,113,536
3Oct 17, 2026 12:1743,277369,937,536357,999,0001,206,0002,113,536
4Oct 17, 2026 12:1743,277370,506,083358,021,0001,180,0002,113,536
5Oct 17, 2026 12:1743,279369,862,277358,062,0001,155,0002,113,536
6Oct 17, 2026 12:1743,282370,057,038358,037,0001,209,0002,113,536
7Oct 17, 2026 12:1743,296370,168,868358,092,0001,271,0002,113,536
8Oct 17, 2026 12:1743,301370,116,240358,144,0001,262,0002,113,536
9Oct 17, 2026 12:1743,851374,774,155362,708,0001,257,0002,113,536