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 listOct 27, 2025 07:45Weitao WanWeitao WanScore: 65,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 07:4565,403571,154,878540,845,0001,999,0002,285,568
2Oct 27, 2025 07:4565,406565,345,883540,869,0001,999,0002,285,568
3Oct 27, 2025 07:4565,414566,520,980541,937,000999,0002,277,376
4Oct 27, 2025 07:4565,415567,390,479541,949,000999,0002,285,568
5Oct 27, 2025 07:4565,428563,027,289541,055,0002,000,0002,285,568
6Oct 27, 2025 07:4565,434564,317,723541,105,0002,000,0002,285,568
7Oct 27, 2025 07:4565,443568,585,222541,180,0002,000,0002,269,184
8Oct 27, 2025 07:4565,488568,706,055542,552,000999,0002,285,568
9Oct 27, 2025 07:4565,656570,270,340543,948,000999,0002,285,568