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 26, 2026 12:27Jamal AbdulovJamal AbdulovScore: 365,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 12:27364,4033,036,428,7172,954,492,00070,055,0002,113,536
2Jun 26, 2026 12:27364,8593,038,175,5812,959,272,00069,060,0002,113,536
3Jun 26, 2026 12:27364,8993,038,595,6602,959,616,00069,053,0002,113,536
4Jun 26, 2026 12:27365,0013,038,937,2912,959,459,00070,055,0002,113,536
5Jun 26, 2026 12:27365,0143,039,083,8942,959,569,00070,052,0002,113,536
6Jun 26, 2026 12:27365,3293,042,131,0342,961,992,00070,243,0002,113,536
7Jun 26, 2026 12:27365,8533,046,411,5522,965,498,00071,082,0002,113,536
8Jun 26, 2026 12:27367,7573,061,735,6052,982,344,00070,045,0002,113,536
9Jun 26, 2026 12:27369,4563,076,109,7132,996,433,00070,057,0002,113,536