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 listOct 14, 2024 00:33Joad NacerJoad NacerScore: 4,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:334,33058,013,14334,945,000998,0002,306,048
2Oct 14, 2024 00:334,35959,764,70335,175,0001,005,0002,306,048
3Oct 14, 2024 00:334,36756,705,93634,232,0002,013,0002,531,328
4Oct 14, 2024 00:334,39258,419,04536,457,00002,269,184
5Oct 14, 2024 00:334,47562,419,52836,138,0001,003,0002,293,760
6Oct 14, 2024 00:334,51264,932,04336,441,0001,012,0002,301,952