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 20:39Karthik ReddyKarthik ReddyScore: 4,582Success
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 20:414,38245,384,93335,276,0001,096,0002,113,536
2Oct 1, 2026 20:414,40545,549,39835,465,0001,103,0002,113,536
3Oct 1, 2026 20:414,55147,028,18936,671,0001,105,0002,113,536
4Oct 1, 2026 20:414,56246,908,69136,767,0001,100,0002,113,536
5Oct 1, 2026 20:414,58247,106,59636,922,0001,112,0002,113,536
6Oct 1, 2026 20:414,61047,263,20537,175,0001,090,0002,113,536
7Oct 1, 2026 20:414,61647,336,94137,219,0001,100,0002,113,536
8Oct 1, 2026 20:414,62047,387,98337,252,0001,094,0002,113,536
9Oct 1, 2026 20:414,64047,502,53037,402,0001,110,0002,113,536