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:22Joad NacerJoad NacerScore: 4,558Success
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:224,32462,078,67734,893,000996,0002,273,280
2Oct 14, 2024 16:224,41059,832,86936,604,00002,301,952
3Oct 14, 2024 16:224,44062,131,74736,855,00002,269,184
4Oct 14, 2024 16:224,55861,174,26835,840,0001,991,0002,297,856
5Oct 14, 2024 16:224,56162,094,43736,863,000996,0002,269,184
6Oct 14, 2024 16:224,61371,515,58336,277,0002,015,0002,535,424