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 listMar 5, 2025 01:44Ian MckibbenIan MckibbenScore: 29,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2025 01:4429,953273,146,611248,614,00002,437,120
2Mar 5, 2025 01:4429,963273,207,449247,693,000998,0002,424,832
3Mar 5, 2025 01:4429,964273,764,462247,706,000998,0002,531,328
4Mar 5, 2025 01:4429,969274,474,477247,743,000998,0002,433,024
5Mar 5, 2025 01:4429,971275,124,248247,764,000999,0002,433,024
6Mar 5, 2025 01:4429,972275,015,420247,768,000999,0002,510,848
7Mar 5, 2025 01:4429,978276,439,790247,820,000999,0002,269,184
8Mar 5, 2025 01:4429,988270,298,925246,901,0001,999,0002,531,328
9Mar 5, 2025 01:4429,991275,352,032246,930,0001,999,0002,269,184