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 16:26Joad NacerJoad NacerScore: 4,444Success
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 16:264,27957,270,78932,473,0003,044,0002,306,048
2Oct 14, 2024 16:264,32260,500,04834,879,000996,0002,531,328
3Oct 14, 2024 16:264,43763,700,39434,840,0001,990,0002,531,328
4Oct 14, 2024 16:264,44458,661,76634,890,0001,993,0002,301,952
5Oct 14, 2024 16:264,58862,775,31536,073,0002,004,0002,301,952
6Oct 14, 2024 16:264,64965,106,03036,554,0002,030,0002,273,280