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 17, 2026 15:55shartgepettoshartgepettoScore: 7,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 15:557,21683,037,67056,895,0002,994,0002,404,352
2Mar 17, 2026 15:557,22584,545,50256,966,0002,998,0002,379,776
3Mar 17, 2026 15:557,25281,846,19956,178,0004,012,0002,486,272
4Mar 17, 2026 15:557,27081,958,34457,324,0003,017,0002,314,240
5Mar 17, 2026 15:557,27184,385,92956,325,0004,023,0002,498,560
6Mar 17, 2026 15:557,27585,890,52755,349,0005,031,0002,412,544
7Mar 17, 2026 15:557,27788,351,83555,365,0005,033,0002,445,312
8Mar 17, 2026 15:557,30492,222,89356,579,0004,041,0002,375,680
9Mar 17, 2026 15:557,36986,675,02654,146,0007,018,0002,465,792