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 16, 2026 05:00shartgepettoshartgepettoScore: 7,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 05:007,68489,331,37359,789,0003,985,0002,330,624
2Mar 16, 2026 05:007,77185,772,32860,470,0004,031,0002,461,696
3Mar 16, 2026 05:007,80090,574,67160,756,0003,984,0002,457,600
4Mar 16, 2026 05:007,80288,960,98160,772,0003,985,0002,355,200
5Mar 16, 2026 05:007,82690,031,00060,961,0003,997,0002,379,776
6Mar 16, 2026 05:007,89286,355,74860,468,0005,039,0002,375,680
7Mar 16, 2026 05:007,90993,196,36960,593,0005,049,0002,293,760
8Mar 16, 2026 05:007,99990,302,39362,367,0004,023,0002,396,160
9Mar 16, 2026 05:008,12791,313,02664,432,0003,020,0002,453,504