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 19, 2024 20:29Javid izadiJavid izadiScore: 326,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 20:29324,9942,723,107,1552,631,489,00065,962,0002,281,472
2Dec 19, 2024 20:29325,1422,724,427,4762,634,707,00063,968,0002,281,472
3Dec 19, 2024 20:29325,4032,730,914,8322,637,874,00062,973,0002,375,680
4Dec 19, 2024 20:29325,8732,729,576,3292,634,776,00069,967,0002,285,568
5Dec 19, 2024 20:29326,0262,731,722,7532,638,038,00067,975,0002,473,984
6Dec 19, 2024 20:29326,4232,735,247,6322,646,351,00062,960,0002,371,584
7Dec 19, 2024 20:29327,4892,751,142,7672,626,219,00091,937,0002,285,568
8Dec 19, 2024 20:29328,2282,748,781,1122,662,329,00061,961,0002,285,568
9Dec 19, 2024 20:29330,9512,769,889,6352,672,921,00073,970,0002,285,568