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:43Aryan JainAryan JainScore: 222,883Success
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:43222,6161,881,662,9841,767,769,00079,944,0002,510,848
2Dec 28, 2024 18:43222,6201,872,042,6271,777,795,00069,952,0002,510,848
3Dec 28, 2024 18:43222,6891,876,322,8531,784,345,00063,976,0002,293,760
4Dec 28, 2024 18:43222,7601,877,452,3261,775,951,00072,956,0002,281,472
5Dec 28, 2024 18:43222,8831,872,334,0391,778,970,00070,958,0002,281,472
6Dec 28, 2024 18:43222,9131,873,826,6761,786,211,00063,971,0002,293,760
7Dec 28, 2024 18:43222,9671,878,102,2021,773,683,00076,942,0002,510,848
8Dec 28, 2024 18:43224,7591,890,557,9031,809,548,00055,955,0002,281,472
9Dec 28, 2024 18:43227,1081,909,279,8321,845,022,00039,978,0002,293,760