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 11, 2025 15:30Bernard TeoBernard TeoScore: 6,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:306,06672,295,35850,344,00002,396,160
2Dec 11, 2025 15:306,06685,752,50549,341,0001,006,0002,400,256
3Dec 11, 2025 15:306,06773,341,27649,345,0001,007,0002,392,064
4Dec 11, 2025 15:306,08375,312,14249,481,0001,009,0002,273,280
5Dec 11, 2025 15:306,08674,708,08749,501,0001,010,0002,387,968
6Dec 11, 2025 15:306,08674,190,69349,502,0001,010,0002,400,256