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 listMar 2, 2026 15:53Priyansh RathiPriyansh RathiScore: 41,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:5341,358370,707,868342,271,0001,000,0002,547,712
2Mar 2, 2026 15:5341,597370,784,334345,254,00002,543,616
3Mar 2, 2026 15:5341,622371,759,958345,463,00002,359,296
4Mar 2, 2026 15:5341,626376,876,368345,497,00002,355,200
5Mar 2, 2026 15:5341,663374,183,941342,808,0002,998,0002,547,712
6Mar 2, 2026 15:5341,729375,140,812343,345,0003,003,0002,535,424
7Mar 2, 2026 15:5341,760376,943,344344,610,0001,997,0002,543,616
8Mar 2, 2026 15:5341,773370,964,376344,720,0001,998,0002,351,104
9Mar 2, 2026 15:5341,805381,447,819345,984,000999,0002,547,712