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 27, 2026 14:02Victor MerckléVictor MerckléScore: 23,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 14:0323,847206,969,546196,908,0001,028,0002,117,632stderr
2Aug 27, 2026 14:0323,855206,368,146196,987,0001,015,0002,117,632stderr
3Aug 27, 2026 14:0323,919206,863,505197,520,0001,013,0002,117,632stderr
4Aug 27, 2026 14:0323,940207,105,770197,643,0001,064,0002,117,632stderr
5Aug 27, 2026 14:0323,992207,518,615198,125,0001,010,0002,117,632stderr
6Aug 27, 2026 14:0323,999207,608,155198,171,0001,021,0002,117,632stderr
7Aug 27, 2026 14:0324,080208,195,813198,854,0001,017,0002,117,632stderr
8Aug 27, 2026 14:0324,255210,728,886200,271,0001,048,0002,117,632stderr
9Aug 27, 2026 14:0324,303210,773,318200,714,0001,006,0002,117,632stderr