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 listJan 10, 2022 07:39Yuriy LyfenkoYuriy LyfenkoScore: 11,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 07:3911,346366,883,91393,170,0001,001,0002,277,376
2Jan 10, 2022 07:3911,354375,387,78794,238,00002,535,424
3Jan 10, 2022 07:3911,356365,488,07593,250,0001,002,0002,277,376
4Jan 10, 2022 07:3911,361368,088,98493,291,0001,003,0002,277,376
5Jan 10, 2022 07:3911,362363,266,16493,300,0001,003,0002,281,472
6Jan 10, 2022 07:3911,364371,111,93793,321,0001,003,0002,277,376
7Jan 10, 2022 07:3911,367372,085,38193,346,0001,003,0002,277,376
8Jan 10, 2022 07:3911,368368,927,50594,352,00002,535,424
9Jan 10, 2022 07:3911,370368,841,08994,367,00002,277,376
10Jan 10, 2022 07:3911,946411,437,25999,148,81602,273,280
11Jan 10, 2022 07:3911,948423,024,78399,169,20902,248,704
12Jan 10, 2022 07:3911,954416,713,83499,216,04602,269,184