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 08:11Victor MerckléVictor MerckléScore: 4,419Success
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 08:134,36944,529,20235,089,0001,177,0002,117,632stderr
2Aug 27, 2026 08:134,39744,890,58435,289,0001,207,0002,117,632stderr
3Aug 27, 2026 08:134,40044,879,07035,441,0001,086,0002,117,632stderr
4Aug 27, 2026 08:134,40644,869,36335,385,0001,188,0002,117,632stderr
5Aug 27, 2026 08:134,41944,941,87135,581,0001,104,0002,117,632stderr
6Aug 27, 2026 08:134,42044,826,04135,523,0001,168,0002,117,632stderr
7Aug 27, 2026 08:134,43345,144,40635,637,0001,164,0002,117,632stderr
8Aug 27, 2026 08:134,44045,161,52035,625,0001,233,0002,117,632stderr
9Aug 27, 2026 08:134,66847,810,54137,676,0001,069,0002,117,632stderr