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 1, 2023 21:49Yuriy LyfenkoYuriy LyfenkoScore: 7,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 21:497,696121,583,48863,880,69202,269,184
2Apr 1, 2023 21:497,714135,565,99764,025,21202,281,472
3Apr 1, 2023 21:497,777131,483,35964,548,16402,281,472