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 listJan 7, 2026 10:49Petsku01Petsku01Score: 45,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 10:4945,376402,330,468375,625,000999,0002,420,736
2Jan 7, 2026 10:4945,384400,636,111375,688,000999,0002,490,368
3Jan 7, 2026 10:4945,392402,317,877373,752,0002,998,0002,420,736
4Jan 7, 2026 10:4945,404409,570,996375,856,000999,0002,424,832
5Jan 7, 2026 10:4945,452402,565,532376,249,0001,000,0002,469,888
6Jan 7, 2026 10:4945,483411,187,187376,510,000998,0002,387,968
7Jan 7, 2026 10:4945,490404,381,909373,570,0003,995,0002,420,736
8Jan 7, 2026 10:4945,494404,033,320375,604,0001,997,0002,461,696
9Jan 7, 2026 10:4945,494403,210,007374,608,0002,996,0002,416,640