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 06:09Victor MerckléVictor MerckléScore: 4,272Success
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 06:104,25743,752,87334,226,0001,112,0002,117,632stderr
2Aug 12, 2026 06:104,26343,839,25734,246,0001,144,0002,117,632stderr
3Aug 12, 2026 06:104,26643,757,50034,302,0001,107,0002,117,632stderr
4Aug 12, 2026 06:104,26643,841,02634,255,0001,155,0002,117,632stderr
5Aug 12, 2026 06:104,27243,594,83534,342,0001,120,0002,117,632stderr
6Aug 12, 2026 06:104,27643,918,94934,452,0001,044,0002,117,632stderr
7Aug 12, 2026 06:104,29043,991,94434,533,0001,078,0002,117,632stderr
8Aug 12, 2026 06:104,30744,215,75834,625,0001,125,0002,117,632stderr
9Aug 12, 2026 06:104,54346,788,35936,662,0001,048,0002,117,632stderr