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 11, 2024 17:02Joad NacerJoad NacerScore: 12,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 17:0212,741132,717,62658,861,00046,889,0002,322,432
2Oct 11, 2024 17:0212,780134,222,67850,033,00056,037,0002,342,912
3Oct 11, 2024 17:0212,848135,615,42152,315,00054,327,0002,392,064