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 6, 2026 14:57Danylo MocherniukDanylo MocherniukScore: 6,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 14:576,64777,796,52152,162,0003,009,0002,531,328
2Apr 6, 2026 14:476,65975,716,85253,263,0002,009,0002,527,232
3Apr 6, 2026 14:476,65979,073,56153,258,0002,009,0002,523,136
4Apr 6, 2026 14:476,66378,625,01753,294,0002,011,0002,297,856
5Apr 6, 2026 14:476,67280,368,85654,375,0001,006,0002,297,856
6Apr 6, 2026 14:576,67678,689,95752,386,0003,022,0002,273,280
7Apr 6, 2026 14:476,68773,844,16054,494,0001,009,0002,297,856
8Apr 6, 2026 14:476,69787,005,77755,589,00002,297,856
9Apr 6, 2026 14:576,70280,660,15853,608,0002,022,0002,514,944
10Apr 6, 2026 14:576,77483,048,79954,217,0002,008,0002,531,328
11Apr 6, 2026 14:576,81078,340,72654,506,0002,018,0002,363,392
12Apr 6, 2026 14:576,87178,805,21654,030,0003,001,0002,297,856