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 listFeb 5, 2025 05:29mebowlermebowlerScore: 96,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2025 05:2996,538826,746,368786,280,00014,986,0002,367,488
2Feb 5, 2025 05:2996,563831,191,009783,482,00017,988,0002,355,200
3Feb 5, 2025 05:2996,615826,090,867785,909,00015,998,0002,371,584