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 16:12Bernard TeoBernard TeoScore: 401,446Success
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 16:12401,4123,362,360,2313,260,771,00070,951,0002,281,472
2Dec 11, 2025 16:12401,4463,359,606,2273,255,050,00076,953,0002,514,944
3Dec 11, 2025 16:12401,7183,362,021,0473,256,298,00077,959,0002,510,848