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 16, 2026 19:36Yuriy LyfenkoYuriy LyfenkoScore: 9,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 19:369,856107,944,75981,808,00002,273,280
2Mar 16, 2026 19:359,859107,468,88178,835,0002,993,0002,260,992
3Mar 16, 2026 19:359,860106,260,82279,845,0001,996,0002,260,992
4Mar 16, 2026 19:359,863115,597,78880,864,000998,0002,269,184
5Mar 16, 2026 19:369,870112,212,66577,929,0003,996,0002,265,088
6Mar 16, 2026 19:369,883108,373,33480,028,0002,000,0002,269,184