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 listJul 16, 2022 05:43Yuriy LyfenkoYuriy LyfenkoScore: 11,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2022 05:4311,195116,511,51991,920,000999,0002,285,568
2Jul 16, 2022 05:4311,197120,976,87090,939,0001,998,0002,527,232
3Jul 16, 2022 05:4311,203121,633,98490,987,0001,999,0002,273,280
4Jul 16, 2022 05:4311,204116,091,92290,997,0001,999,0002,277,376
5Jul 16, 2022 05:4311,210117,973,21591,044,0002,000,0002,273,280
6Jul 16, 2022 05:4311,212117,929,61791,057,0002,001,0002,269,184
7Jul 16, 2022 05:4311,213121,493,97592,071,0001,000,0002,273,280
8Jul 16, 2022 05:4311,215122,343,66091,086,0002,001,0002,285,568
9Jul 16, 2022 05:4311,509122,093,69094,520,0001,005,0002,277,376
10Jul 16, 2022 05:4311,800158,022,78497,939,32602,285,568
11Jul 16, 2022 05:4311,806159,828,04297,989,94702,293,760
12Jul 16, 2022 05:4311,812167,304,31898,037,41402,273,280