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 listApr 10, 2026 11:47Danylo MocherniukDanylo MocherniukScore: 5,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 11:475,81069,069,46745,212,0003,014,0002,297,856
2Apr 10, 2026 11:475,81676,189,88146,264,0002,011,0002,277,376
3Apr 10, 2026 11:475,83469,511,44046,403,0002,017,0002,387,968
4Apr 10, 2026 11:475,85172,401,84946,544,0002,023,0002,297,856
5Apr 10, 2026 11:475,85175,423,87746,538,0002,023,0002,297,856
6Apr 10, 2026 11:475,85375,300,38846,554,0002,024,0002,387,968
7Apr 10, 2026 11:475,88376,120,95345,840,0002,989,0002,392,064
8Apr 10, 2026 11:475,88572,458,57545,852,0002,990,0002,297,856
9Apr 10, 2026 11:475,89978,088,82745,964,0002,997,0002,297,856
10Apr 10, 2026 11:475,92071,867,05646,129,0003,008,0002,387,968
11Apr 10, 2026 11:475,94480,794,06447,324,0002,013,0002,383,872
12Apr 10, 2026 11:476,03271,661,15147,061,0003,003,0002,297,856