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 07:11Karthik ReddyKarthik ReddyScore: 3,410Success
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 07:123,40437,954,76227,079,0001,182,0002,113,536
2Oct 1, 2026 07:123,40537,747,69527,095,0001,168,0002,113,536
3Oct 1, 2026 07:123,40537,240,41427,095,0001,169,0002,113,536
4Oct 1, 2026 07:123,40737,179,01227,114,0001,167,0002,113,536
5Oct 1, 2026 07:123,41037,711,30827,137,0001,173,0002,113,536
6Oct 1, 2026 07:123,41037,314,18527,138,0001,170,0002,113,536
7Oct 1, 2026 07:123,42137,429,53627,225,0001,175,0002,113,536
8Oct 1, 2026 07:123,42437,409,37127,250,0001,176,0002,113,536
9Oct 1, 2026 07:123,43237,472,42327,455,0001,037,0002,113,536