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 listOct 15, 2024 20:48Elnur RakhmatullinElnur RakhmatullinScore: 48,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 20:4848,712424,909,228403,311,0001,000,0002,367,488
2Oct 15, 2024 20:4848,730431,500,422404,460,00002,277,376
3Oct 15, 2024 20:4848,738430,570,879402,527,0001,997,0002,277,376
4Oct 15, 2024 20:4848,749432,387,908401,618,0002,997,0002,277,376
5Oct 15, 2024 20:4848,750434,968,551401,628,0002,997,0002,277,376
6Oct 15, 2024 20:4848,751434,316,761402,637,0001,998,0002,277,376
7Oct 15, 2024 20:4848,752433,685,932402,644,0001,998,0002,535,424
8Oct 15, 2024 20:4848,753434,810,738402,656,0001,998,0002,277,376
9Oct 15, 2024 20:4848,761436,409,213401,717,0002,997,0002,269,184