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 23:24MikeMikeScore: 78,588Success
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 23:2478,528676,595,467647,783,0003,998,0002,318,336
2Oct 11, 2024 23:2478,528680,343,019649,784,0001,999,0002,322,432
3Oct 11, 2024 23:2478,541680,537,684648,891,0002,999,0002,469,888
4Oct 11, 2024 23:2478,580679,959,478650,214,0002,000,0002,322,432
5Oct 11, 2024 23:2478,588678,985,375651,280,0001,000,0002,322,432
6Oct 11, 2024 23:2478,595681,702,248650,341,0002,001,0002,318,336
7Oct 11, 2024 23:2478,604677,164,659648,414,0004,002,0002,461,696
8Oct 11, 2024 23:2478,620682,748,878651,545,000999,0002,465,792
9Oct 11, 2024 23:2478,641681,691,859650,725,0001,999,0002,469,888