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 16, 2026 15:32marko1597marko1597Score: 5,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 15:365,05651,066,89340,782,0001,187,0002,117,632
2Aug 16, 2026 15:365,05951,101,55140,968,0001,026,0002,117,632
3Aug 16, 2026 15:365,06350,502,30441,009,0001,018,0002,117,632
4Aug 16, 2026 15:365,06450,505,62541,029,0001,010,0002,117,632
5Aug 16, 2026 15:365,06450,455,60041,011,0001,025,0002,117,632
6Aug 16, 2026 15:365,06450,528,67441,024,0001,014,0002,117,632
7Aug 16, 2026 15:365,06551,224,26641,029,0001,011,0002,117,632
8Aug 16, 2026 15:365,07051,271,86741,080,0001,006,0002,117,632
9Aug 16, 2026 15:365,07351,214,63540,991,0001,119,0002,117,632