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 26, 2026 16:49Victor MerckléVictor MerckléScore: 3,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 16:503,83839,998,62730,681,0001,182,0002,117,632stderr
2Aug 26, 2026 16:503,86340,335,07431,000,0001,066,0002,117,632stderr
3Aug 26, 2026 16:503,86640,385,65030,988,0001,104,0002,117,632stderr
4Aug 26, 2026 16:503,87740,581,79331,062,0001,125,0002,117,632stderr
5Aug 26, 2026 16:503,92340,973,36331,417,0001,152,0002,117,632stderr
6Aug 26, 2026 16:503,92740,701,21231,490,0001,109,0002,117,632stderr
7Aug 26, 2026 16:503,95841,014,85731,777,0001,078,0002,117,632stderr
8Aug 26, 2026 16:503,98741,449,66132,026,0001,073,0002,117,632stderr
9Aug 26, 2026 16:504,02041,758,76532,296,0001,070,0002,117,632stderr