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 listAug 11, 2026 15:30RabenknechtRabenknechtScore: 58,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 15:3056,490478,941,307467,833,0001,041,0002,113,536
2Aug 11, 2026 15:3056,501478,990,179467,916,0001,045,0002,113,536
3Aug 11, 2026 15:3056,513479,853,012468,021,0001,044,0002,113,536
4Aug 11, 2026 15:3056,608479,910,530468,783,0001,066,0002,113,536
5Aug 11, 2026 15:3058,171493,681,952481,707,0001,116,0002,113,536
6Aug 11, 2026 15:3058,216493,326,213482,119,0001,075,0002,113,536
7Aug 11, 2026 15:3058,236494,159,577482,240,0001,119,0002,113,536
8Aug 11, 2026 15:3058,239493,916,704482,382,0001,002,0002,113,536
9Aug 11, 2026 15:3058,255493,685,826482,465,0001,055,0002,113,536