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 12, 2026 23:33Victor MerckléVictor MerckléScore: 3,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 23:343,72839,386,03629,839,0001,109,0002,117,632stderr
2Aug 12, 2026 23:343,76239,416,96429,949,0001,279,0002,117,632stderr
3Aug 12, 2026 23:343,76839,720,74230,085,0001,191,0002,117,632stderr
4Aug 12, 2026 23:343,77939,782,56030,279,0001,094,0002,117,632stderr
5Aug 12, 2026 23:343,78839,854,51030,340,0001,108,0002,117,632stderr
6Aug 12, 2026 23:343,80039,961,36130,523,0001,017,0002,117,632stderr
7Aug 12, 2026 23:343,80239,808,37930,462,0001,096,0002,117,632stderr
8Aug 12, 2026 23:343,80539,986,85130,490,0001,097,0002,117,632stderr
9Aug 12, 2026 23:343,87840,512,83130,979,0001,209,0002,117,632stderr