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 22, 2025 20:34Ashish AhujaAshish AhujaScore: 11,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 20:3411,582126,086,16879,281,00016,847,0002,506,752
2Aug 22, 2025 20:3411,611123,343,22878,491,00017,884,0002,420,736
3Aug 22, 2025 20:3411,702130,275,99978,294,00018,830,0002,506,752
4Aug 22, 2025 21:0111,755120,262,57778,653,00018,916,0002,318,336
5Aug 22, 2025 20:3411,756122,769,61078,655,00018,917,0002,383,872
6Aug 22, 2025 21:0111,769126,441,87878,747,00018,939,0002,400,256
7Aug 22, 2025 20:3411,819130,858,95380,263,00017,836,0002,510,848
8Aug 22, 2025 20:3411,879127,390,42978,680,00019,919,0002,506,752
9Aug 22, 2025 21:0111,961127,675,13080,416,00018,863,0002,506,752