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 22, 2025 17:07KeefeKeefeScore: 59,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 17:0759,393512,746,210491,965,000999,0002,269,184
2Apr 22, 2025 17:0759,495518,242,463491,809,0001,999,0002,400,256
3Apr 22, 2025 17:0759,623516,948,516493,875,000999,0002,269,184