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 listNov 18, 2024 00:45zielajzielajScore: 3,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2024 00:213,59660,506,53427,859,0001,989,0002,523,136
2Nov 18, 2024 00:453,59855,478,61427,872,0001,990,0002,363,392
3Nov 18, 2024 00:213,60457,622,13027,918,0001,994,0002,371,584
4Nov 18, 2024 00:453,61849,340,49128,027,0002,001,0002,453,504
5Nov 18, 2024 00:453,62756,268,18229,099,0001,003,0002,514,944
6Nov 18, 2024 00:213,65655,131,70029,330,0001,011,0002,523,136
7Nov 18, 2024 00:213,77153,754,14430,289,0001,009,0002,387,968
8Nov 18, 2024 00:213,77553,589,49231,330,00002,473,984
9Nov 18, 2024 00:453,77755,518,82431,347,00002,383,872
10Nov 18, 2024 00:213,83758,107,71031,850,00002,387,968
11Nov 18, 2024 00:453,83863,326,61029,863,0001,990,0002,269,184
12Nov 18, 2024 00:453,95760,372,49930,852,0001,990,0002,387,968