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 19, 2026 17:48A_ShamanA_ShamanScore: 42,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:4842,148359,214,717265,858,00083,976,0002,113,536
2Jun 19, 2026 17:4842,195359,411,553266,271,00083,954,0002,113,536
3Jun 19, 2026 17:4842,299360,156,724266,164,00084,923,0002,113,536
4Jun 19, 2026 17:4842,689363,504,613267,583,00086,736,0002,113,536
5Jun 19, 2026 17:4842,748364,475,730267,738,00087,073,0002,113,536
6Jun 19, 2026 17:4842,899365,209,313267,771,00088,294,0002,113,536
7Jun 19, 2026 17:4842,909365,208,321268,184,00087,966,0002,113,536
8Jun 19, 2026 17:4842,913365,142,006268,237,00087,948,0002,113,536
9Jun 19, 2026 17:4843,101367,993,580267,649,00090,097,0002,113,536