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 listAug 7, 2026 16:18TonyTonyScore: 6,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 16:206,22061,464,36249,069,0002,557,0002,113,536
2Aug 7, 2026 16:206,23461,555,64649,164,0002,583,0002,113,536
3Aug 7, 2026 16:206,24161,621,08149,173,0002,633,0002,113,536
4Aug 7, 2026 16:206,24661,655,63149,286,0002,558,0002,113,536
5Aug 7, 2026 16:206,25561,718,87849,315,0002,602,0002,113,536
6Aug 7, 2026 16:206,27561,844,10549,523,0002,561,0002,113,536
7Aug 7, 2026 16:206,28261,949,79749,454,0002,690,0002,113,536
8Aug 7, 2026 16:206,28861,962,67749,631,0002,563,0002,113,536
9Aug 7, 2026 16:206,31962,199,50549,869,0002,584,0002,113,536