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,071Success
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,06050,449,46740,987,0001,015,0002,117,632
2Aug 16, 2026 15:365,06250,457,06341,009,0001,010,0002,117,632
3Aug 16, 2026 15:365,06350,516,92141,015,0001,013,0002,117,632
4Aug 16, 2026 15:365,06651,152,00941,010,0001,038,0002,117,632
5Aug 16, 2026 15:365,07151,705,10741,052,0001,045,0002,117,632
6Aug 16, 2026 15:365,07750,579,13841,124,0001,019,0002,117,632
7Aug 16, 2026 15:365,07751,263,78141,132,0001,008,0002,117,632
8Aug 16, 2026 15:365,08150,707,37241,131,0001,045,0002,117,632
9Aug 16, 2026 15:365,08251,417,01141,163,0001,018,0002,117,632