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 19, 2025 23:06Advait IyerAdvait IyerScore: 56,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2025 23:0656,579504,295,265468,606,000999,0002,265,088
2Oct 19, 2025 23:0656,580497,513,124468,613,000999,0002,285,568
3Oct 19, 2025 23:0656,596500,113,257467,752,0001,998,0002,285,568