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 listDec 28, 2024 18:50Aryan JainAryan JainScore: 206,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 18:50206,6391,741,766,5241,654,138,00060,968,0002,281,472
2Dec 28, 2024 18:50206,6491,738,541,8991,654,213,00060,971,0002,293,760
3Dec 28, 2024 18:50206,6501,740,721,0781,645,232,00069,967,0002,281,472
4Dec 28, 2024 18:50206,6831,737,972,3421,625,495,00089,972,0002,293,760
5Dec 28, 2024 18:50206,6851,740,178,7891,661,503,00053,983,0002,289,664
6Dec 28, 2024 18:50206,7471,743,276,3881,646,041,00069,959,0002,281,472
7Dec 28, 2024 18:50206,7621,745,376,3851,639,163,00076,960,0002,281,472
8Dec 28, 2024 18:50206,7731,739,586,3401,648,246,00067,968,0002,289,664
9Dec 28, 2024 18:50206,8351,744,660,5241,648,784,00067,949,0002,281,472