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 listJan 9, 2025 03:05Ian MckibbenIan MckibbenScore: 56,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 03:0556,340493,651,055466,626,000999,0002,293,760
2Jan 9, 2025 03:0556,363493,836,096465,812,0001,999,0002,293,760
3Jan 9, 2025 03:0556,400502,423,028467,116,0001,000,0002,277,376