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 listFeb 17, 2026 20:46wnwnScore: 7,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 20:466,29883,892,42447,249,0005,026,0002,478,080
2Feb 17, 2026 20:466,36576,649,72350,839,0001,993,0002,473,984
3Feb 17, 2026 20:466,52077,190,02251,114,0003,006,0002,359,296
4Feb 17, 2026 20:467,17986,842,05955,547,0004,039,0002,490,368
5Feb 17, 2026 20:467,23185,649,04858,017,0002,000,0002,453,504
6Feb 17, 2026 20:467,23587,598,86457,050,0003,002,0002,473,984
7Feb 17, 2026 20:467,25784,559,61558,227,0002,007,0002,523,136
8Feb 17, 2026 20:467,26582,059,75358,293,0002,010,0002,412,544
9Feb 17, 2026 20:467,34181,805,73956,937,0003,995,0002,277,376
10Feb 17, 2026 20:467,41085,539,22957,471,0004,033,0002,433,024
11Feb 17, 2026 20:467,44484,755,98957,800,0003,986,0002,351,104
12Feb 17, 2026 20:467,65596,266,80860,511,0003,025,0002,342,912