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 26, 2025 09:34Ashish AhujaAshish AhujaScore: 11,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 09:3410,983119,797,80872,330,00018,825,0002,408,448
2Aug 26, 2025 09:3411,039121,610,09171,705,00019,918,0002,490,368
3Aug 26, 2025 09:3411,134115,582,74673,532,00018,879,0002,494,464
4Aug 26, 2025 09:3411,171117,788,36176,765,00015,951,0002,490,368
5Aug 26, 2025 09:3411,252122,194,11075,508,00017,883,0002,486,272
6Aug 26, 2025 09:3411,310127,891,21873,898,00019,972,0002,482,176