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 listNov 8, 2025 21:37izotoffizotoffScore: 191,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 21:37191,1301,612,298,7711,506,409,00079,968,0002,293,760
2Nov 8, 2025 21:37191,2071,613,297,4091,509,069,00077,951,0002,498,560
3Nov 8, 2025 21:37191,3161,619,824,0961,507,976,00079,945,0002,408,448
4Nov 8, 2025 21:37191,3421,618,910,9661,509,184,00078,957,0002,404,352
5Nov 8, 2025 21:37191,4231,618,909,2821,508,873,00079,940,0002,326,528
6Nov 8, 2025 21:37191,4331,615,954,5621,507,948,00080,943,0002,326,528
7Nov 8, 2025 21:37191,4431,618,327,5521,506,030,00082,946,0002,326,528
8Nov 8, 2025 21:37191,6561,619,790,5871,509,807,00080,936,0002,322,432
9Nov 8, 2025 21:37194,2171,639,821,0911,526,055,00085,946,0002,449,408