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 17:46marko1597marko1597Score: 6,525Success
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 17:495,04050,290,32940,660,0001,173,0002,117,632
2Aug 16, 2026 17:495,04550,371,26440,841,0001,037,0002,117,632
3Aug 16, 2026 17:495,04851,014,85740,727,0001,177,0002,117,632
4Aug 16, 2026 17:496,13859,478,60149,858,0001,089,0002,117,632
5Aug 16, 2026 17:496,52562,593,44252,976,0001,188,0002,117,632
6Aug 16, 2026 17:496,68663,797,47254,315,0001,182,0002,117,632
7Aug 16, 2026 17:496,75365,377,00954,872,0001,186,0002,117,632
8Aug 16, 2026 17:496,92465,962,17556,295,0001,176,0002,117,632
9Aug 16, 2026 17:496,93366,210,65556,371,0001,178,0002,117,632