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 listOct 1, 2026 08:21Karthik ReddyKarthik ReddyScore: 3,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 08:213,35936,902,17526,803,0001,082,0002,113,536
2Oct 1, 2026 08:213,36136,889,35726,826,0001,076,0002,113,536
3Oct 1, 2026 08:213,36336,863,32926,824,0001,097,0002,113,536
4Oct 1, 2026 08:213,37538,735,27426,926,0001,090,0002,113,536
5Oct 1, 2026 08:213,38137,031,04426,962,0001,103,0002,113,536
6Oct 1, 2026 08:213,39037,094,92826,960,0001,185,0002,113,536
7Oct 1, 2026 08:213,40037,279,22427,201,0001,020,0002,113,536
8Oct 1, 2026 08:213,40439,085,14027,117,0001,142,0002,113,536
9Oct 1, 2026 08:213,42637,451,58527,315,0001,125,0002,113,536