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 25, 2026 01:22Victor MerckléVictor MerckléScore: 4,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:234,17142,977,88333,549,0001,073,0002,117,632stderr
2Aug 25, 2026 01:234,18842,921,10533,655,0001,107,0002,117,632stderr
3Aug 25, 2026 01:234,19143,122,96233,707,0001,080,0002,117,632stderr
4Aug 25, 2026 01:234,19643,021,65733,758,0001,073,0002,117,632stderr
5Aug 25, 2026 01:234,21343,215,43533,883,0001,091,0002,117,632stderr
6Aug 25, 2026 01:234,22243,493,84433,973,0001,074,0002,117,632stderr
7Aug 25, 2026 01:234,22443,358,82834,045,0001,022,0002,117,632stderr
8Aug 25, 2026 01:234,32344,055,90234,792,0001,093,0002,117,632stderr
9Aug 25, 2026 01:234,35544,526,02634,968,0001,180,0002,117,632stderr