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 11, 2024 16:57Joad NacerJoad NacerScore: 4,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 16:574,41563,670,74635,627,0001,017,0002,273,280
2Oct 11, 2024 16:574,44060,737,82933,861,0002,987,0002,301,952
3Oct 11, 2024 16:574,44067,712,83734,860,0001,992,0002,310,144
4Oct 11, 2024 16:574,46560,890,84335,054,0002,003,0002,297,856
5Oct 11, 2024 16:574,47263,767,78236,117,0001,003,0002,531,328
6Oct 11, 2024 16:574,47856,654,10536,166,0001,004,0002,531,328