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 9, 2026 17:19TonyTonyScore: 5,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2026 17:195,44755,194,14942,577,0002,636,0002,113,536
2Aug 9, 2026 17:195,47555,406,54842,803,0002,647,0002,113,536
3Aug 9, 2026 17:195,52955,894,89343,260,0002,636,0002,113,536
4Aug 9, 2026 17:195,55356,840,05044,044,0002,051,0002,113,536
5Aug 9, 2026 17:195,57656,538,15243,487,0002,794,0002,113,536
6Aug 9, 2026 17:195,58056,438,65744,259,0002,061,0002,113,536
7Aug 9, 2026 17:195,59657,156,72344,384,0002,063,0002,113,536
8Aug 9, 2026 17:195,60258,465,79244,454,0002,043,0002,113,536
9Aug 9, 2026 17:195,64457,535,46544,779,0002,072,0002,113,536