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 19:51Elnur RakhmatullinElnur RakhmatullinScore: 52,698Success
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 19:5152,682458,107,511436,259,0001,000,0002,277,376
2Oct 15, 2024 19:5152,685460,303,412436,289,0001,000,0002,269,184
3Oct 15, 2024 19:5152,690459,657,487435,327,0002,001,0002,277,376
4Oct 15, 2024 19:5152,698468,913,579437,392,00002,273,280
5Oct 15, 2024 19:5152,698466,091,811436,396,0001,000,0002,277,376
6Oct 15, 2024 19:5152,704466,561,643436,444,0001,001,0002,277,376
7Oct 15, 2024 19:5152,704463,477,755436,444,0001,001,0002,277,376
8Oct 15, 2024 19:5152,726463,401,784436,629,000999,0002,273,280
9Oct 15, 2024 19:5152,729471,183,296436,648,000999,0002,277,376