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 15:56Elnur RakhmatullinElnur RakhmatullinScore: 64,552Success
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 15:5664,456559,688,576444,986,00089,997,0002,367,488
2Oct 15, 2024 15:5664,457562,511,805457,993,00076,998,0002,277,376
3Oct 15, 2024 15:5664,458565,951,552463,001,00072,000,0002,330,624
4Oct 15, 2024 15:5664,524566,754,992462,611,00072,938,0002,392,064
5Oct 15, 2024 15:5664,552562,761,935455,816,00079,967,0002,351,104
6Oct 15, 2024 15:5664,690563,935,800453,935,00082,988,0002,371,584
7Oct 15, 2024 15:5666,452580,004,047461,624,00089,926,0002,363,392
8Oct 15, 2024 15:5666,528582,026,177462,317,00089,867,0002,359,296
9Oct 15, 2024 15:5666,544577,430,278464,426,00087,891,0002,277,376