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 24, 2026 23:14Victor MerckléVictor MerckléScore: 4,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 23:153,89440,679,30431,094,0001,227,0002,117,632stderr
2Aug 24, 2026 23:153,95041,165,63731,751,0001,042,0002,117,632stderr
3Aug 24, 2026 23:153,98941,591,77231,980,0001,134,0002,117,632stderr
4Aug 24, 2026 23:154,00942,310,36132,177,0001,099,0002,117,632stderr
5Aug 24, 2026 23:154,02441,770,23632,360,0001,043,0002,117,632stderr
6Aug 24, 2026 23:154,02641,838,94432,344,0001,078,0002,117,632stderr
7Aug 24, 2026 23:154,02741,796,65132,340,0001,092,0002,117,632stderr
8Aug 24, 2026 23:154,02943,236,68032,345,0001,100,0002,117,632stderr
9Aug 24, 2026 23:154,16342,892,06833,516,0001,043,0002,117,632stderr