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 listSep 16, 2025 17:31sheryllynn24sheryllynn24Score: 37,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2025 17:3135,511325,948,293292,740,0001,998,0002,277,376
2Sep 16, 2025 17:3137,743342,606,873312,266,0001,000,0002,265,088
3Sep 16, 2025 17:3137,774336,938,389312,524,0001,001,0002,265,088