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 16, 2026 18:36marko1597marko1597Score: 4,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 18:404,55647,344,43236,656,0001,159,0002,113,536
2Aug 16, 2026 18:404,57746,382,50236,948,0001,047,0002,113,536
3Aug 16, 2026 18:404,57746,413,15836,947,0001,045,0002,113,536
4Aug 16, 2026 18:404,58446,366,47237,007,0001,041,0002,113,536
5Aug 16, 2026 18:404,59046,621,28937,029,0001,068,0002,113,536
6Aug 16, 2026 18:404,59046,527,12837,051,0001,049,0002,113,536
7Aug 16, 2026 18:404,59346,523,44237,086,0001,042,0002,113,536
8Aug 16, 2026 18:404,61246,618,72837,237,0001,046,0002,113,536
9Aug 16, 2026 18:404,73347,673,98938,241,0001,051,0002,113,536