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 8, 2025 20:25Ashish AhujaAshish AhujaScore: 2,704,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 20:192,701,38028,326,762,64320,476,760,0001,944,692,0002,404,352
2Aug 8, 2025 20:192,702,70328,113,746,73720,429,935,0002,002,504,0002,342,912
3Aug 8, 2025 20:062,702,90728,416,830,28120,465,834,0001,968,291,0002,412,544
4Aug 8, 2025 20:252,703,54228,343,230,00720,427,386,0002,012,014,0002,482,176
5Aug 8, 2025 20:062,704,13528,760,172,62520,421,148,0002,023,169,0002,363,392
6Aug 8, 2025 20:062,710,15528,469,134,26320,522,067,0001,972,216,0002,277,376
7Aug 8, 2025 20:252,711,70628,403,608,63220,512,626,0001,994,532,0002,347,008
8Aug 8, 2025 20:192,714,43529,845,382,97420,528,144,0002,001,669,0002,486,272
9Aug 8, 2025 20:252,721,24528,489,760,78620,594,684,0001,991,650,0002,396,160