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 listDec 5, 2025 03:55warshipwarshipScore: 104,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 03:55103,533883,225,480623,507,000235,813,0002,285,568
2Dec 5, 2025 03:55103,648885,377,206603,496,000256,785,0002,351,104
3Dec 5, 2025 03:55103,848887,628,547611,250,000250,692,0002,273,280
4Dec 5, 2025 03:55103,920893,525,940608,674,000253,864,0002,277,376
5Dec 5, 2025 03:55104,010888,086,596615,491,000247,795,0002,273,280
6Dec 5, 2025 03:55104,168891,898,914610,715,000253,881,0002,510,848
7Dec 5, 2025 03:55104,199895,228,768604,197,000260,653,0002,285,568
8Dec 5, 2025 03:55104,234889,559,371620,385,000244,757,0002,490,368
9Dec 5, 2025 03:55104,327892,723,081599,251,000266,666,0002,289,664