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 18, 2026 03:31Yuriy LyfenkoYuriy LyfenkoScore: 4,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 03:314,68059,898,58237,847,000995,0002,301,952
2Mar 18, 2026 03:314,68063,411,69736,853,0001,992,0002,469,888
3Mar 18, 2026 03:314,68163,950,60737,853,000996,0002,473,984
4Mar 18, 2026 03:314,68366,697,58036,872,0001,993,0002,478,080
5Mar 18, 2026 03:314,72065,406,72038,169,0001,004,0002,465,792
6Mar 18, 2026 03:314,94067,449,30439,002,0002,000,0002,531,328
7Mar 18, 2026 03:314,94365,612,25139,025,0002,001,0002,269,184
8Mar 18, 2026 03:314,94868,893,37139,067,0002,003,0002,473,984
9Mar 18, 2026 03:314,97069,800,86739,243,0002,012,0002,469,888