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 6, 2024 13:02Matthew BookerMatthew BookerScore: 74,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2024 13:0274,161645,292,406604,542,00010,991,000274,432
2Sep 6, 2024 13:0274,241636,666,357604,199,00012,003,000278,528
3Sep 6, 2024 13:0274,338636,715,640604,008,00013,000,000315,392