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:27MikeMikeScore: 78,090Success
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:2778,043672,181,674644,759,0002,998,0002,322,432
2Oct 11, 2024 23:2778,066674,047,411644,946,0002,999,0002,318,336
3Oct 11, 2024 23:2778,068668,346,719645,965,0001,999,0002,449,408
4Oct 11, 2024 23:2778,081667,638,959645,075,0003,000,0002,322,432
5Oct 11, 2024 23:2778,090676,127,499648,147,00002,322,432
6Oct 11, 2024 23:2778,103677,612,713647,254,0001,000,0002,469,888
7Oct 11, 2024 23:2778,117674,333,687647,372,0001,000,0002,322,432
8Oct 11, 2024 23:2778,138675,315,493646,546,0001,998,0002,469,888
9Oct 11, 2024 23:2778,145675,488,093645,606,0002,998,0002,322,432