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 listSep 7, 2026 14:52Kevin PetersKevin PetersScore: 70,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:5370,668596,558,119533,310,00053,238,0002,113,536
2Sep 7, 2026 14:5370,708596,882,812533,594,00053,289,0002,113,536
3Sep 7, 2026 14:5370,709596,762,293533,624,00053,263,0002,113,536
4Sep 7, 2026 14:5370,722596,938,741533,709,00053,291,0002,113,536
5Sep 7, 2026 14:5370,723596,885,148533,745,00053,259,0002,113,536
6Sep 7, 2026 14:5370,743597,077,263532,929,00054,245,0002,113,536
7Sep 7, 2026 14:5370,761597,243,347533,967,00053,353,0002,113,536
8Sep 7, 2026 14:5370,771597,273,383533,061,00054,343,0002,113,536
9Sep 7, 2026 14:5370,825597,772,601533,581,00054,273,0002,113,536