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 2, 2026 14:01CodeReclaimersCodeReclaimersScore: 6,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:016,75266,766,77555,036,0001,012,0002,113,536
2Aug 2, 2026 14:016,76266,908,31255,117,0001,010,0002,113,536
3Aug 2, 2026 14:016,77466,956,61055,218,0001,011,0002,113,536
4Aug 2, 2026 14:016,78967,091,33355,338,0001,012,0002,113,536
5Aug 2, 2026 14:016,80469,344,52255,468,0001,012,0002,117,632
6Aug 2, 2026 14:016,82867,392,80355,663,0001,012,0002,113,536
7Aug 2, 2026 14:016,83867,508,72155,559,0001,203,0002,113,536
8Aug 2, 2026 14:016,86266,927,42855,952,0001,010,0002,113,536
9Aug 2, 2026 14:016,87167,078,54856,019,0001,011,0002,113,536