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 8, 2026 05:52howenhowenScore: 88,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 05:5288,017753,844,355493,691,000236,852,0002,494,464
2Feb 8, 2026 05:5288,025755,719,717492,734,000237,871,0002,465,792
3Feb 8, 2026 05:5288,028756,633,017492,752,000237,880,0002,473,984
4Feb 8, 2026 05:5288,211762,234,955493,430,000238,724,0002,289,664
5Feb 8, 2026 05:5288,257761,599,307491,687,000240,846,0002,412,544
6Feb 8, 2026 05:5288,426764,887,831493,286,000240,652,0002,326,528
7Feb 8, 2026 05:5288,440762,926,241493,364,000240,689,0002,375,680
8Feb 8, 2026 05:5288,597761,775,163492,568,000242,787,0002,473,984
9Feb 8, 2026 05:5288,654763,572,764493,213,000242,613,0002,289,664