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 1, 2026 21:19TonyTonyScore: 52,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 21:2052,697445,824,854436,391,0001,002,0002,117,632
2Aug 1, 2026 21:2052,709445,747,325436,490,0001,002,0002,117,632
3Aug 1, 2026 21:2052,709445,956,227436,481,0001,005,0002,117,632
4Aug 1, 2026 21:2052,709446,179,950436,485,0001,005,0002,117,632
5Aug 1, 2026 21:2052,710445,926,714436,498,0001,002,0002,117,632
6Aug 1, 2026 21:2052,714446,018,011436,525,0001,002,0002,117,632
7Aug 1, 2026 21:2052,717446,414,469436,555,0001,002,0002,117,632
8Aug 1, 2026 21:2052,725445,908,600436,620,0001,001,0002,117,632
9Aug 1, 2026 21:2052,749446,055,517436,814,0001,004,0002,117,632