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 listSep 5, 2024 11:28Mikhail ShirokovMikhail ShirokovScore: 53,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2024 23:0853,725470,308,619444,916,000999,0002,273,280
2Sep 5, 2024 11:2853,730476,061,168445,963,00002,277,376
3Dec 16, 2024 23:0853,750468,229,445445,123,0001,000,0002,383,872
4Oct 22, 2024 23:2553,753469,848,701446,153,00002,379,776
5Oct 22, 2024 23:2553,760474,654,777445,209,0001,000,0002,379,776
6Sep 5, 2024 11:2853,767471,275,464445,267,0001,000,0002,277,376
7Oct 22, 2024 23:2553,771475,303,633446,300,00002,277,376
8Dec 16, 2024 23:0853,787476,110,279446,432,00002,273,280
9Sep 5, 2024 11:2853,888471,250,016447,274,00002,277,376