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:46limanjun99limanjun99Score: 64,936Success
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:4664,842564,841,502471,165,00067,023,0002,269,184
2Jun 5, 2025 13:4664,849567,132,946471,215,00067,030,0002,269,184
3Jun 5, 2025 13:4664,891567,913,871490,630,00047,963,0002,269,184
4Jun 5, 2025 13:4664,925564,720,828465,893,00072,983,0002,269,184
5Jun 5, 2025 13:4664,936568,031,272477,974,00060,996,0002,379,776
6Jun 5, 2025 13:4664,993564,001,938463,382,00076,062,0002,269,184
7Jun 5, 2025 13:4665,035569,009,639474,816,00064,974,0002,269,184
8Jun 5, 2025 13:4665,092567,692,055473,229,00067,032,0002,387,968
9Jun 5, 2025 13:4665,279567,792,224462,843,00078,973,0002,269,184