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 listApr 23, 2025 18:33KeefeKeefeScore: 51,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 18:3251,260453,878,692423,458,0001,997,0002,269,184
2Apr 23, 2025 18:3351,280456,501,803424,624,000999,0002,269,184
3Apr 23, 2025 18:3251,677460,457,181427,924,000999,0002,404,352
4Apr 23, 2025 18:3351,702451,995,513429,130,00002,269,184
5Apr 23, 2025 18:3351,713458,856,384428,221,0001,000,0002,269,184
6Apr 23, 2025 18:3251,856457,614,989428,406,0002,001,0002,269,184