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 listJun 5, 2025 13:01limanjun99limanjun99Score: 395,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2025 13:01394,4813,300,361,6353,195,234,00078,956,0002,510,848
2Jun 5, 2025 13:01394,5933,304,002,3273,196,170,00078,954,0002,289,664
3Jun 5, 2025 13:01394,9033,307,290,5373,206,723,00070,971,0002,281,472
4Jun 5, 2025 13:01394,9743,301,777,7193,204,327,00073,961,0002,281,472
5Jun 5, 2025 13:01395,0663,312,146,2733,186,103,00092,944,0002,281,472
6Jun 5, 2025 13:01395,3363,306,657,7493,212,322,00068,963,0002,289,664
7Jun 5, 2025 13:01395,7773,313,683,5733,219,989,00064,959,0002,281,472
8Jun 5, 2025 13:01396,7243,321,233,1733,233,833,00058,978,0002,289,664
9Jun 5, 2025 13:01405,1853,386,717,2453,295,077,00067,960,0002,506,752