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 listFeb 27, 2026 21:14lipapipalipapipaScore: 5,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 21:145,71067,961,45345,373,0002,016,0002,461,696
2Feb 27, 2026 21:145,74180,694,58244,606,0003,041,0002,404,352
3Feb 27, 2026 21:145,78775,162,69245,032,0003,002,0002,392,064
4Feb 27, 2026 21:145,80776,447,29645,183,0003,012,0002,379,776
5Feb 27, 2026 21:145,81274,392,39846,229,0002,009,0002,375,680
6Feb 27, 2026 21:145,84673,926,20746,503,0002,021,0002,375,680
7Feb 27, 2026 21:145,86772,910,37846,668,0002,029,0002,519,040
8Feb 27, 2026 21:145,88275,133,95346,827,0001,992,0002,289,664
9Feb 27, 2026 21:145,96872,117,58348,526,0001,010,0002,367,488