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:07Advait IyerAdvait IyerScore: 56,599Success
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:0756,584498,020,593467,647,0001,998,0002,285,568
2Oct 19, 2025 23:0756,599491,374,586467,772,0001,999,0002,260,992
3Oct 19, 2025 23:0756,749497,567,396466,014,0005,000,0002,510,848