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 listMar 26, 2026 06:05poyo180605poyo180605Score: 60,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 06:0560,633525,430,212454,227,00049,024,0002,510,848
2Mar 26, 2026 06:0560,648529,586,583456,346,00047,035,0002,293,760
3Mar 26, 2026 06:0560,713525,674,806450,923,00052,991,0002,285,568