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 4, 2025 06:12Abhigyan NiranjanAbhigyan NiranjanScore: 394,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 06:12394,5683,307,313,8373,199,964,00074,952,0002,281,472
2Jun 4, 2025 06:12394,5983,302,589,4263,198,206,00076,956,0002,281,472
3Jun 4, 2025 06:12394,6053,305,600,7763,215,257,00059,967,0002,281,472
4Jun 4, 2025 06:12394,6303,299,494,4563,191,473,00083,959,0002,289,664
5Jun 4, 2025 06:12394,6873,303,593,8603,206,926,00068,976,0002,281,472
6Jun 4, 2025 06:12394,7203,309,254,7053,202,222,00073,958,0002,281,472
7Jun 4, 2025 06:12394,8243,306,211,7793,207,083,00069,958,0002,289,664
8Jun 4, 2025 06:12395,4923,306,543,6973,228,605,00053,976,0002,281,472
9Jun 4, 2025 06:12396,0113,320,897,2123,230,912,00055,981,0002,293,760