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 27, 2025 05:56matsuoka-601matsuoka-601Score: 47,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 05:5647,795426,649,939394,701,0001,998,0002,277,376
2Jan 27, 2025 05:5647,797424,254,103395,716,000999,0002,273,280
3Jan 27, 2025 05:5647,797422,630,790394,716,0001,998,0002,277,376