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:53Weitao WanWeitao WanScore: 41,769Success
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:5341,747372,947,314346,500,00002,285,568
2Oct 27, 2025 07:5341,754376,966,189345,564,000998,0002,285,568
3Oct 27, 2025 07:5341,765374,274,954344,651,0001,997,0002,285,568
4Oct 27, 2025 07:5341,766373,441,088346,660,00002,285,568
5Oct 27, 2025 07:5341,769370,498,427344,681,0001,998,0002,285,568
6Oct 27, 2025 07:5341,772375,239,203345,706,000999,0002,285,568
7Oct 27, 2025 07:5341,774373,565,937344,728,0001,998,0002,285,568
8Oct 27, 2025 07:5341,777375,316,039344,748,0001,998,0002,285,568
9Oct 27, 2025 07:5341,778375,043,823344,762,0001,998,0002,273,280