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 08:26George SeabridgeGeorge SeabridgeScore: 7,830Success
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 08:267,80075,495,72263,646,0001,097,0002,113,536
2Aug 2, 2026 08:267,81774,926,52163,799,0001,086,0002,113,536
3Aug 2, 2026 08:267,82375,604,36063,849,0001,090,0002,113,536
4Aug 2, 2026 08:267,82774,983,65963,700,0001,267,0002,113,536
5Aug 2, 2026 08:267,83074,948,70363,911,0001,080,0002,113,536
6Aug 2, 2026 08:267,83175,680,41663,911,0001,093,0002,113,536
7Aug 2, 2026 08:267,87276,551,77964,248,0001,096,0002,113,536
8Aug 2, 2026 08:267,88676,170,14464,349,0001,110,0002,113,536
9Aug 2, 2026 08:267,88975,448,50264,391,0001,091,0002,113,536